280 search results - page 11 / 56 » Equivalence of Two Formal Semantics for Functional Logic Pro... |
ESOP
2012
Springer
12 years 3 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...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Translation validation consists of transforming a program and a posteriori validating it in order to detect a modification of its semantics. This approach can be used in a verifie...
POPL
2010
ACM
14 years 5 months ago
2010
ACM
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
ESOP
2005
Springer
14 years 1 months ago
2005
Springer
ite-state abstraction scheme such as predicate abstraction. The type system, which is also parametric, type checks exactly those programs that are accepted by the model checker. It...