Sciweavers

43 search results - page 2 / 9
» Parametric polymorphism and operational equivalence
Sort
View
LICS
2008
IEEE
14 years 1 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
ENTCS
2006
153views more  ENTCS 2006»
13 years 7 months ago
Parametric Domain-theoretic Models of Polymorphic Intuitionistic / Linear Lambda Calculus
We present a formalization of a version of Abadi and Plotkin's logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show,...
Lars Birkedal, Rasmus Ejlers Møgelberg, Ras...
FOSSACS
2009
Springer
14 years 2 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
ESOP
2004
Springer
14 years 25 days ago
Answer Type Polymorphism in Call-by-Name Continuation Passing
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
Hayo Thielecke
ICFP
2008
ACM
14 years 7 months ago
Scala for generic programmers
Datatype-generic programming involves parametrization by the shape of data, in the form of type constructors such as `list of'. Most approaches to datatype-generic programmin...
Bruno C. D. S. Oliveira, Jeremy Gibbons