Abstract
A new formalism, called Hiord, for defining type-free higher-order logic programming languages with predicate abstraction is introduced. A model theory, based on partial combinatory algebras, is presented, with respect to which the formalism is shown sound. A programming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is considered, along with several examples. © Springer-Verlag Berlin Heidelberg 2004.
Cite
CITATION STYLE
Cabeza, D., Hermenegildo, M., & Lipton, J. (2004). Hiord: A type-free higher-order logic programming language with predicate abstraction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3321, 93–108. https://doi.org/10.1007/978-3-540-30502-6_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
