Hiord: a type-free higher-order logic programming language with predicate abstraction

Authors:
Daniel Cabeza;Manuel Hermenegildo;James Lipton
Affiliations:
Technical University of Madrid, Spain;Technical University of Madrid, Spain;Technical University of Madrid, Spain
Venue:
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Year:
2004

Citing 5
Cited 2

A note on inconsistencies caused by fixpoints in a Cartesian closed category

Theoretical Computer Science
Higher-order Horn clauses

Journal of the ACM (JACM)
HILOG: a foundation for higher-order logic programming

Journal of Logic Programming
Abstract Syntax and Logic Programming

Proceedings of the First Russian Conference on Logic Programming
A Logic for Reasoning with Higher-Order Abstract Syntax

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

A syntactic approach to combining functional notation, lazy evaluation, and higher-order in LP systems

FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Modules for prolog revisited

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.