60 search results - page 1 / 12 » Termination and Reduction Checking for Higher-Order Logic Pr... |
77
Voted
CADE
2001
Springer
15 years 10 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
LMCS
2007
14 years 10 months ago
2007
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
LISP
2008
14 years 10 months ago
2008
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
POPL
1997
ACM
15 years 2 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
108
click to vote
CADE
2005
Springer
15 years 10 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...