Uniqueness Typing Simplified

Cached

Download Links

by Edsko De Vries , Rinus Plasmeijer , David M Abrahamson
Citations:3 - 0 self

Active Bibliography

1 QML: Explicit First-Class Polymorphism for ML – Claudio V. Russo, Dimitrios Vytiniotis
3 D.: Uniqueness typing redefined – Edsko De Vries, Rinus Plasmeijer, David Abrahamson - 2006
PRACTICAL TYPE INFERENCE FOR FIRST-CLASS POLYMORPHISM – Dimitrios Vytiniotis - 2008
FPH: First-class polymorphism for Haskell -- Extended Version – Dimitrios Vytiniotis - 2008
54 Quasi-Linear Types – Naoki Kobayashi - 1999
10 A Type Based Sharing Analysis for Update Avoidance and Optimisation – Jörgen Gustavsson - 1998
26 Call-by-Name, Call-by-Value, Call-by-Need, and the Linear Lambda Calculus – John Maraist, Martin Odersky, David N. Turner, Philip Wadler - 1994
33 Once Upon a Polymorphic Type – Keith Wansbrough, Simon Peyton Jones - 1998
77 Once Upon a Type – David Turner, Philip Wadler, Christian Mossin - 1995
1 Equality based uniqueness typing – Edsko De Vries, Rinus Plasmeijer, David M Abrahamson - 2007
129 Simple unification-based type inference for GADTs – Simon Peyton Jones - 2006
3 Recasting ML^F – Didier Le Botlan, Didier Rémy - 2007
AspectML: . . . functional programming language – Daniel Dantas, David Walker, Geoffrey Washburn, Stephanie Weirich - 2008
1 Stateful Contracts for Affine Types ∗ – Jesse A. Tov, Riccardo Pucella
1 Objects to unify type classes and GADTs – Bruno C. D. S. Oliveira, Martin Sulzmann
4 Making Implicit Parameters Explicit – Atze Dijkstra, S. Doaitse Swierstra - 2005
1 Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri - 2009
Reasoning about Selective Strictness -- Operational Equivalence, Heaps and Call-by-Need Evaluation, New Inductive Principles – Seyed H. Haeri (Hossein) - 2009
FPH: First-class Polymorphism for Haskell Declarative, constraint-free type inference for impredicative polymorphism – Dimitrios Vytiniotis, Stephanie Weirich, Simon Peyton Jones