367 search results - page 8 / 74 » Adapting functional programs to higher order logic |
181
click to vote
CADE
2005
Springer
16 years 5 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...
174
click to vote
CADE
2003
Springer
16 years 5 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...
153
click to vote
IFL
2003
Springer
15 years 10 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...
173
click to vote
TLCA
2007
Springer
15 years 11 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...
