43 search results - page 3 / 9 » Lazy Behavioral Subtyping |
ESOP
2012
Springer
12 years 1 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...
ENTCS
2000
13 years 5 months ago
2000
Behavioral rewriting di ers from standard rewriting in taking account of the weaker inference rules of behavioral logic, but it shares much with standard rewriting, including noti...
AOSD
2003
ACM
13 years 11 months ago
2003
ACM
There are two important points of view on inclusion or subtype polymorphism in object-oriented programs, namely polymorphic access and dynamic dispatch. These features are essenti...
GLOBECOM
2010
IEEE
13 years 3 months ago
2010
IEEE
Distributed and peer-to-peer storage systems are foreseen as an alternative to the traditional data centers and in-house backup solutions. In the past few years many peerto-peer st...
POPL
2009
ACM
14 years 6 months ago
2009
ACM
The call-by-need lambda calculus provides an equational framework for reasoning syntactically about lazy evaluation. This paper examines its operational characteristics. By a seri...