Hiord: A type-free higher-order logic programming language with predicate abstraction
| Data(s) |
2005
|
|---|---|
| Resumo |
A new formalism, called Hiord, for defining type-free higherorder 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. |
| Formato |
application/pdf |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
Facultad de Informática (UPM) |
| Relação |
http://oa.upm.es/14365/1/HERME_ARC_2004-1.pdf http://link.springer.com/chapter/10.1007%2F978-3-540-30502-6_7 |
| Direitos |
http://creativecommons.org/licenses/by-nc-nd/3.0/es/ info:eu-repo/semantics/openAccess |
| Fonte |
Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making | 9th Asian Computing Science Conference. Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday | December 8-10, 2004 | Chiang Mai, Thailand |
| Palavras-Chave | #Informática |
| Tipo |
info:eu-repo/semantics/conferenceObject Ponencia en Congreso o Jornada PeerReviewed |
