A terminating and confluent linear lambda calculus

Authors:
Yo Ohta;Masahito Hasegawa
Affiliations:
Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan;Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan
Venue:
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Year:
2006

Citing 10
Cited 5

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Linear logic

Theoretical Computer Science
Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
A reflection on call-by-value

ACM Transactions on Programming Languages and Systems (TOPLAS)
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
What is a Categorical Model of Intuitionistic Linear Logic?

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Girard translation and logical predicates

Journal of Functional Programming
Classical linear logic of implications

Mathematical Structures in Computer Science
Reducibility and ⊤⊤-lifting for computation types

TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications

Resource operators for λ-calculus

Information and Computation
Extensional rewriting with sums

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Delayed substitutions

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
The structural λ-calculus

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
A short proof that adding some permutation rules to β preserves SN

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a rewriting system for the linear lambda calculus corresponding to the {!, $\multimap$}-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.