Full text
|
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (764kB) | Preview |
Cabeza Gras, Daniel and Hermenegildo, Manuel V. and Lipton, James (2005). Hiord: A type-free higher-order logic programming language with predicate abstraction. In: "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. ISBN 9783540240877.
Title: | Hiord: A type-free higher-order logic programming language with predicate abstraction |
---|---|
Author/s: |
|
Item Type: | Presentation at Congress or Conference (Article) |
Event Title: | 9th Asian Computing Science Conference. Dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday |
Event Dates: | December 8-10, 2004 |
Event Location: | Chiang Mai, Thailand |
Title of Book: | Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making |
Date: | 2005 |
ISBN: | 9783540240877 |
Volume: | 3321 |
Subjects: | |
Faculty: | Facultad de Informática (UPM) |
Department: | Inteligencia Artificial |
Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
|
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (764kB) | Preview |
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.
Item ID: | 14365 |
---|---|
DC Identifier: | https://oa.upm.es/14365/ |
OAI Identifier: | oai:oa.upm.es:14365 |
Official URL: | http://link.springer.com/chapter/10.1007%2F978-3-540-30502-6_7 |
Deposited by: | Biblioteca Facultad de Informatica |
Deposited on: | 27 Jan 2013 06:54 |
Last Modified: | 21 Apr 2016 14:00 |