A terminating and confluent linear lambda calculus (2006)
| Venue: | PROC. OF 17TH INT. CONFERENCE RTA 2006, VOLUME 4098 OF LECTURE NOTES IN COMPUTER SCIENCE |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Ohta06aterminating,
author = {Yo Ohta and Masahito Hasegawa},
title = {A terminating and confluent linear lambda calculus},
booktitle = {PROC. OF 17TH INT. CONFERENCE RTA 2006, VOLUME 4098 OF LECTURE NOTES IN COMPUTER SCIENCE},
year = {2006},
pages = {166--180},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a rewriting system for the linear lambda calculus corresponding to the {!, ⊸}-fragment of intuitionistic linear logic. This rewriting system is shown to be strongly normalizing, and Church-Rosser modulo the trivial commuting conversion. Thus it provides a simple decision method for the equational theory of the linear lambda calculus. As an application we prove the strong normalization of the simply typed computational lambda calculus by giving a reduction-preserving translation into the linear lambda calculus.
