HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

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 metadata

https://hal.inria.fr/inria-00074287
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:57:40 PM
Last modification on : Friday, February 4, 2022 - 3:23:15 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

71

Files downloads

70