The (Lazy) Functional Side of Logic Programming
| dc.creator | Etalle, S. | |
| dc.creator | Mountjoy, J. | |
| dc.date | 2000-03-20 | |
| dc.date.accessioned | 2026-07-07T03:16:07Z | |
| dc.date.available | 2026-07-07T03:16:07Z | |
| dc.description | The possibility of translating logic programs into functional ones has long been a subject of investigation. Common to the many approaches is that the original logic program, in order to be translated, needs to be well-moded and this has led to the common understanding that these programs can be considered to be the ``functional part'' of logic programs. As a consequence of this it has become widely accepted that ``complex'' logical variables, the possibility of a dynamic selection rule, and general properties of non-well-moded programs are exclusive features of logic programs. This is not quite true, as some of these features are naturally found in lazy functional languages. We readdress the old question of what features are exclusive to the logic programming paradigm by defining a simple translation applicable to a wider range of logic programs, and demonstrate that the current circumscription is unreasonably restrictive. | |
| dc.description | 23 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0003070 | |
| dc.identifier | http://arxiv.org/abs/cs/0003070 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30228 | |
| dc.subject | Programming Languages | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.1.1; D.1.6; D.3.2; F.3.3 | |
| dc.title | The (Lazy) Functional Side of Logic Programming | |
| dc.type | text |