12 search results - page 1 / 3 » Reasoning about Contextual Equivalence: From Untyped to Poly... |
GI
2009
Springer
13 years 9 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
LICS
2012
IEEE
11 years 7 months ago
2012
IEEE
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
LICS
2010
IEEE
13 years 3 months ago
2010
IEEE
—We provide a syntactic analysis of contextual preorder and equivalence for a polymorphic programming language with effects. Our approach applies uniformly across a range of alge...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...