19 search results - page 1 / 4 » Typed Normal Form Bisimulation for Parametric Polymorphism |
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
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...
JMLC
1997
Springer
13 years 9 months ago
1997
Springer
Strongly typed polymorphism is necessary for expressing safe reusable code. Two orthogonal forms of polymorphism exist: inclusion and parametric, the Oberon language only supports ...
ECOOP
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Precise type information is invaluable for analysis and optimization of object-oriented programs. Some forms of polymorphism found in object-oriented languages pose signi...
DLS
2007
13 years 8 months ago
2007
The analogy between types and contracts raises the question of how many features of static type systems can be expressed as dynamic contracts. An important feature missing in prio...