Skip to Main content Skip to Navigation

A Pragmatic Reconstruction of LambdaProlog

Catherine Belleannée 1 Pascal Brisset 1 Olivier Ridoux 1 
1 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : λProlog is a logic programming language in which hereditary Harrop formulas generalise Horn formulas, and simply typed λ-terms generalise Prolog terms. One may wonder whether these extensions are simultaneously required, and if it exists useful subsets of λProlog, at least for pedagogical purposes. We answer this question by exhibiting a network of necessity links between the new features of λProlog. A handy programming heuristic can be proposed after these necessity links for defining relations by induction on types.
Document type :
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:56:37 PM
Last modification on : Friday, February 4, 2022 - 3:24:33 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:07:49 AM


  • HAL Id : inria-00074285, version 1


Catherine Belleannée, Pascal Brisset, Olivier Ridoux. A Pragmatic Reconstruction of LambdaProlog. [Research Report] RR-2390, INRIA. 1994. ⟨inria-00074285⟩



Record views


Files downloads