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 :
Reports
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00074285
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:56:37 PM
Last modification on : Friday, November 16, 2018 - 1:31:24 AM
Long-term archiving on : Monday, April 5, 2010 - 12:07:49 AM

Identifiers

  • HAL Id : inria-00074285, version 1

Citation

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

Share

Metrics

Record views

327

Files downloads

184