367 search results - page 8 / 74 » Adapting functional programs to higher order logic |
CADE
2005
Springer
14 years 9 months ago
2005
Springer
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
CADE
2003
Springer
14 years 9 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
IFL
2003
Springer
14 years 1 months ago
2003
Springer
Abstract This paper presents a type-based analysis for inferring sizeand cost-equations for recursive, higher-order and polymorphic functional programs without requiring user annot...
TLCA
2007
Springer
14 years 2 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
ASIAN
2004
Springer
14 years 2 months ago
2004
Springer
