A note on type checking linear functional languages

Authors:
Apostolos Syropoulos
Affiliations:
-
Venue:
ACM SIGPLAN Notices
Year:
1996

Citing 3
Cited 0

Linear logic

Theoretical Computer Science
The linear abstract machine

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A linear functional language is based on a linear λ-calculus. Any linear functional program must observe linearity and it has to be type correct. Type correctness can be ensured by means of a type-checking system. A type checker for a linear functional language is essentially a type-checker for an ordinary functional language, modified to properly handle the modality ofcourse.