Sciweavers

429 search results - page 3 / 86
» Parameter-free polymorphic types
Sort
View
ESOP
2004
Springer
13 years 11 months ago
Answer Type Polymorphism in Call-by-Name Continuation Passing
Abstract. This paper studies continuations by means of a polymorphic type system. The traditional call-by-name continuation passing style transform admits a typing in which some an...
Hayo Thielecke
CSL
2008
Springer
13 years 7 months ago
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama,...
TACS
1997
Springer
13 years 9 months ago
Type System for Specializing Polymorphism
Abstract. Flexibility of programming and efficiency of program execution are two important features of a programming language. Unfortunately, however, there is an inherent conflict...
Atsushi Ohori
POPL
2009
ACM
14 years 6 months ago
Flexible types: robust type inference for first-class polymorphism
We present HML, a type inference system that supports full firstclass polymorphism where few annotations are needed: only function parameters with a polymorphic type need to be an...
Daan Leijen
ULPAA
1994
152views Hardware» more  ULPAA 1994»
13 years 7 months ago
Programming with ASN.1 Using Polymorphic Types and Type Specialization
object-oriented abstractions is described that permits direct programming with ASN.1 speci ed types. The design and implementation also supports the exible use of di erent encoding...
R. Greg Lavender, Dennis G. Kafura, R. W. Mullins