Higher-order logic programming languages with constraints: A semantics



Downloads per month over past year

Nieva Soto, Susana and Lipton, James (2007) Higher-order logic programming languages with constraints: A semantics. In Typed lambda calculi and applications. Lecture Notes in Computer Science (4583). Springer Verlag Berlín, Berlii, pp. 272-289. ISBN 978-3-540-73227-3

[thumbnail of Nieva03.pdf] PDF
Restringido a Repository staff only


Official URL: http://link.springer.com/chapter/10.1007%2F978-3-540-73228-0_20


A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church's Theory of Types and a generic constraint formalism. Our syntactic formal system, hoHH(C) (higher-order hereditary Harrop formulas with constraints), which extends lambda Prolog's logic, is shown sound and complete. A Kripke semantics for equational reasoning in the simply typed lambda-calculus (Kripke Lambda Models) was introduced by Mitchell and Moggi in 1990. Our model theory extends this semantics to include full impredicative higher-order intuitionistic logic, as well as the executable hoHH fragment with typed lambda-abstraction, implication and universal quantification in goals and constraints. This provides a Kripke semantics for the full higher-order hereditarily Harrop logic of lambda Prolog as a special case (with the constraint system chosen to be,13,beta,eta-conversion).

Item Type:Book Section
Additional Information:

8th International Conference,TLCA 2007, Paris, France,June 26-28, 2007. Proceedings

Subjects:Sciences > Computer science > Programming languages (Electronic computers)
ID Code:17160
Deposited On:22 Nov 2012 10:18
Last Modified:16 Nov 2018 18:18

Origin of downloads

Repository Staff Only: item control page