1982 search results - page 6 / 397 » Parametricity and dependent types |
HASKELL
2006
ACM
15 years 3 months ago
2006
ACM
In languages that support polymorphic variants, a single variant value can be passed to many contexts that accept different sets of constructors. Polymorphic variants are potenti...
FOSSACS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
TLDI
2009
ACM
15 years 6 months ago
2009
ACM
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
LICS
2008
IEEE
15 years 4 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...
102
click to vote
SAS
1994
Springer
15 years 1 months ago
1994
Springer
Constraint-based analysis is a technique for inferring implementation types. Traditionally it has been described using mathematical formalisms. We explain it in a different and mor...