Sciweavers

599 search results - page 12 / 120
» Type System for Specializing Polymorphism
Sort
View
JFP
2006
103views more  JFP 2006»
15 years 2 months ago
Phantom types and subtyping
We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to mo...
Matthew Fluet, Riccardo Pucella
LICS
2008
IEEE
15 years 9 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
TIC
1998
Springer
15 years 7 months ago
Type-Directed Continuation Allocation
Suppose we translate two different source languages,
Zhong Shao, Valery Trifonov
APLAS
2000
ACM
15 years 7 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
POPL
2006
ACM
16 years 3 months ago
Polymorphic regular tree types and patterns
We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different typ...
Jerome Vouillon