Weak linearization of the lambda calculus

Authors:
Sandra Alves;Mário Florido
Affiliations:
Department of Computer Science & LIACC, University of Porto, Porto, Portugal;Department of Computer Science & LIACC, University of Porto, Porto, Portugal
Venue:
Theoretical Computer Science - Applied semantics: Selected topics
Year:
2005

Citing 10
Cited 2

Linear logic

Theoretical Computer Science
BCK-combinators and linear &lgr;-terms have types

Theoretical Computer Science
Computational interpretations of linear logic

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Paths, computations and labels in the &lgr;-calculus

RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Basic simple type theory

Basic simple type theory
Perpetual reductions in &lgr;-calculus

Information and Computation
Relating typability and expressiveness in finite-rank intersection type systems (extended abstract)

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Linear Logic, Monads and the Lambda Calculus

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Linearization of the lambda-calculus and its relation with intersection type systems

Journal of Functional Programming

Gödel's system T revisited

Theoretical Computer Science
Linearity and recursion in a typed Lambda-calculus

Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We identify a restricted class of terms of the lambda calculus, here called weak linear, that includes the linear lambda-terms keeping their good properties of strong normalization, non-duplicating reductions and typability in polynomial time. The advantage of this class over the linear lambda-calculus is the possibility of transforming general terms into weak linear terms with the same normal form. We present such transformation and prove its correctness by showing that it preserves normal forms.