239 search results - page 32 / 48 » Partial Evaluation of Functional Logic Programs |
118
click to vote
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
133
click to vote
PEPM
2011
ACM
14 years 3 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
96
Voted
PEPM
2010
ACM
15 years 9 months ago
2010
ACM
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
123
Voted
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
ESOP
2012
Springer
13 years 8 months ago
2012
Springer
The existing call-by-need λ calculi describe lazy evaluation via equational logics. A programmer can use these logics to safely ascertain whether one term is behaviorally equivale...