321 search results - page 8 / 65 » Programming with ASN.1 Using Polymorphic Types and Type Spec... |
GI
2009
Springer
13 years 11 months ago
2009
Springer
: This paper describes a syntactical method for contextual equivalence in polymorphically typed lambda-calculi. Our specific calculus has letrec as cyclic let, data constructors, ...
ICFP
2005
ACM
14 years 6 months ago
2005
ACM
MLF is a type system that extends a functional language with impredicative rank-n polymorphism. Type inference remains possible and only in some clearly defined situations, a loca...
HASKELL
2006
ACM
14 years 20 days 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...
AFP
1995
Springer
13 years 10 months ago
1995
Springer
The Hindley/Milner type system has been widely adopted as a basis for statically typed functional languages. One of the main reasons for this is that it provides an elegant comprom...
POPL
2005
ACM
14 years 7 months ago
2005
ACM
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...