Imagining CLP (Lambda, alphabeta)

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 : We study under which conditions the domain of lambda-terms (Lambda) and the equality theory of the lambda-calculus (alphabeta) form the basis of a usable constraint logic programming language (CLP). The conditions are that the equality theory must contain axiom eta-gamma, and the formula language must depart from Horn clauses and accept universal quantifications and implications in goals. In short, gammaCLP(lambda gamma(alphabeta) must be close to lambdaProlog.
keyword : LP CLP LAMBDACALCULUS
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074287
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:57:40 PM
Last modification on : Friday, November 16, 2018 - 1:22:31 AM
Long-term archiving on : Sunday, April 4, 2010 - 10:14:48 PM

Identifiers

  • HAL Id : inria-00074287, version 1

Citation

Olivier Ridoux. Imagining CLP (Lambda, alphabeta). [Research Report] RR-2388, INRIA. 1994. ⟨inria-00074287⟩

Share

Metrics

Record views

150

Files downloads

102