34 search results - page 6 / 7 » A Complete Narrowing Calculus for Higher-Order Functional Lo... |
104
click to vote
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
163
click to vote
POPL
2006
ACM
15 years 9 months ago
2006
ACM
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
114
click to vote
CI
2000
14 years 9 months ago
2000
Kowalski and Sergot's Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which prop...
101
click to vote
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...