Sciweavers

Share
PPCP
1993

Higher-Order Logic Programming as Constraint Logic Programming

9 years 11 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable binding via λabstraction. They have been used for a wide range of applications including theorem proving, programming language interpretation, type inference, compilation, and natural language parsing. Despite their utility, current language implementations have acquired a well-deserved reputation for being inefficient. In this paper we argue that HOLP languages can reasonably be viewed as Constraint Logic Programming (CLP) languages, and show how this can be expected to lead to more practical implementations by applying the known principles for the design and implementation of practical CLP systems.
Spiro Michaylov, Frank Pfenning
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1993
Where PPCP
Authors Spiro Michaylov, Frank Pfenning
Comments (0)
books