Uniqueness typing in natural deduction style

Authors:
Erik Barendsen;Sjaak Smetsers
Affiliations:
University of Nijmegen, Computing Science Institute, Nijmegen, The Netherlands;University of Nijmegen, Computing Science Institute, Nijmegen, The Netherlands
Venue:
FP'95 Proceedings of the 1995 international conference on Functional Programming
Year:
1995

Citing 6
Cited 0

Term graph rewriting

Volume II: Parallel Languages on PARLE: Parallel Architectures and Languages Europe
Once upon a type

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Uniqueness Type Inference

PLILPS '95 Proceedings of the 7th International Symposium on Programming Languages: Implementations, Logics and Programs
Conventional and Uniqueness Typing in Graph Rewrite Systems

Proceedings of the 13th Conference on Foundations of Software Technology and Theoretical Computer Science
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Equational term graph rewriting

Equational term graph rewriting

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present two type systems for graph rewriting: conventional typing and (polymorphic) uniqueness typing. The latter is introduced as a natural extension of simple algebraic and higher-order uniqueness typing. The systems are given in natural deduction style using an inductive syntax of graph denotations with familiar constructs such as let and case. The conventional system resembles traditional Curry-style typing systems in functional programming languages. Uniqueness typing extends this with reference count information. In both type systems, typing is preserved during evaluation, and types can be determined effectively. Due to the present formalization, the system can easily be compared with other proposals based on linear and affine logic.