Uniqueness Typing Simplified

Authors:
Edsko Vries;Rinus Plasmeijer;David M. Abrahamson
Affiliations:
Trinity College Dublin, Ireland;Radboud Universiteit Nijmegen, Netherlands;Trinity College Dublin, Ireland
Venue:
Implementation and Application of Functional Languages
Year:
2008

Citing 19
Cited 5

Is there a use for linear logic?

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A natural semantics for lazy evaluation

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A system of constructor classes: overloading and implicit higher-order polymorphism

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Once upon a type

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Term rewriting and all that

Term rewriting and all that
Principal type-schemes for functional programs

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Observers for Linear Types

ESOP '92 Proceedings of the 4th European Symposium on Programming
A linear logical framework

Information and Computation
MLF: raising ML to the power of system F

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
The call-by-need lambda calculus

Journal of Functional Programming
Putting curry-howard to work

Proceedings of the 2005 ACM SIGPLAN workshop on Haskell
Uniqueness logic

Theoretical Computer Science - Algebraic methods in language processing
Boxy types: inference for higher-rank types and impredicativity

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
System F with type equality coercions

TLDI '07 Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation
Practical type inference for arbitrary-rank types

Journal of Functional Programming
A generic usage analysis with subeffect qualifiers

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Heap recycling for lazy languages

PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Engineering formal metatheory

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Uniqueness typing redefined

IFL'06 Proceedings of the 18th international conference on Implementation and application of functional languages

Lolliproc: to concurrency from classical linear logic via curry-howard and control

Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Practical affine types

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Non-monadic models of mutable references

CEFP'09 Proceedings of the Third summer school conference on Central European functional programming school
Purity in erlang

IFL'10 Proceedings of the 22nd international conference on Implementation and application of functional languages
Making "stricterness" more relevant

Higher-Order and Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a uniqueness type system that is simpler than both Clean's uniqueness system and a system we proposed previously. The new type system is straightforward to implement and add to existing compilers, and can easily be extended with advanced features such as higher rank types and impredicativity. We describe our implementation in Morrow, an experimental functional language with both these features. Finally, we prove soundness of the core type system with respect to the call-by-need lambda calculus.