8 search results - page 1 / 2 » Parametricity, type equality, and higher-order polymorphism |
POPL
1997
ACM
13 years 9 months ago
1997
ACM
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
FOSSACS
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. We solve the problem of extending Bird and Paterson’s generalized folds for nested datatypes and its dual to inductive and coinductive constructors of arbitrarily high ...
JFP
2010
13 years 3 months ago
2010
APLAS
2008
ACM
13 years 7 months ago
2008
ACM
Abstract. We propose c2-calculus, which is a second-order polymorphic call-by-value calculus with extensional universal types. Unlike product types or function types in call-by-val...
LICS
2005
IEEE
13 years 11 months ago
2005
IEEE
Run-time type analysis allows programmers to easily and concisely define operations based upon type structure, such as serialization, iterators, and structural equality. However,...