A Note On Type Checking Linaer Functional Languages

@article{Syropoulos1996ANO,
  title={A Note On Type Checking Linaer Functional Languages},
  author={Apostolos Syropoulos},
  journal={SIGPLAN Notices},
  year={1996},
  volume={31},
  pages={80-83}
}
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.