429 search results - page 26 / 86 » Parameter-free polymorphic types |
FPCA
1989
15 years 3 months ago
1989
Bounded quantification was introduced by Cardelli and Wegner as a means of typing functions that operate uniformly over all subtypes of a given type. They defined a simple “ob...
117
click to vote
TLCA
2009
Springer
15 years 6 months ago
2009
Springer
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
POPL
2003
ACM
15 years 5 months ago
2003
ACM
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
103
click to vote
TLDI
2009
ACM
15 years 8 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...
CODES
2004
IEEE
15 years 3 months ago
2004
IEEE
High-level hardware modeling is an essential, yet time-consuming, part of system design. However, effective component-based reuse in hardware modeling languages can reduce model c...