Imagining CLP (Lambda, alphabeta) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1994

Imagining CLP (Lambda, alphabeta)

Olivier Ridoux

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.

Keywords

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2388.pdf (283.13 Ko) Télécharger le fichier

Dates and versions

inria-00074287 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00074287 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More