429 search results - page 56 / 86 » Parameter-free polymorphic types |
171
click to vote
POPL
2008
ACM
16 years 3 days ago
2008
ACM
When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)disc...
TLCA
2007
Springer
15 years 6 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
192
click to vote
POPL
2007
ACM
16 years 3 days ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
118
click to vote
OOPSLA
2005
Springer
15 years 5 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
105
click to vote
POPL
1998
ACM
15 years 4 months ago
1998
ACM
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...