Skip to Main content Skip to Navigation
Journal articles

A pragmatic reconstruction of Lambda-Prolog

Catherine Belleannee 1 Pascal Brisset 2 Olivier Ridoux 3
1 Dyliss - Dynamics, Logics and Inference for biological Systems and Sequences
Inria Rennes – Bretagne Atlantique , IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
3 LIS - Logical Information Systems
IRISA-D7 - GESTION DES DONNÉES ET DE LA CONNAISSANCE
Abstract : Lambda-Prolog is a logic programming language in which hereditary Harrop formulas generalize Horn formulas, and simply typed lambda-terms generalize Prolog terms. One may wonder if these extensions are simultaneously required, and if useful subsets of lambda-Prolog can be defined, at least for pedagogical purposes. We answer this question by exhibiting a network of necessity links between the new features of lambda-Prolog. The starting point of the network is the demand for programming by structural induction on lambda-terms, and the necessity links give a rationale for such a programming style.
Document type :
Journal articles
Complete list of metadatas

https://hal-enac.archives-ouvertes.fr/hal-00934033
Contributor : Laurence Porte <>
Submitted on : Friday, January 31, 2014 - 3:44:11 PM
Last modification on : Friday, July 10, 2020 - 4:00:17 PM

Links full text

Identifiers

Citation

Catherine Belleannee, Pascal Brisset, Olivier Ridoux. A pragmatic reconstruction of Lambda-Prolog. Journal of Logic Programming, Elsevier, 1999, 41 (1), pp 67-102. ⟨10.1016/S0743-1066(98)10038-9⟩. ⟨hal-00934033⟩

Share

Metrics

Record views

637