378 search results - page 1 / 76 » Higher-order transformation of logic programs |
117
Voted
CADE
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Proof-carrying code and other applications in computer security require machine-checkable proofs of properties of machine-language programs. These in turn require axioms ...
161
click to vote
LICS
1994
IEEE
15 years 5 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...
118
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
103
Voted
AGP
1999
IEEE
15 years 5 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
128
click to vote
FLOPS
1999
Springer
15 years 5 months ago
1999
Springer
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these s...