research-article

Linearity and recursion in a typed Lambda-calculus

Authors:

Maribel Fernández,

Mário Florido,

Ian MackieAuthors Info & Claims

PPDP '11: Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming

Pages 173 - 182

https://doi.org/10.1145/2003476.2003500

Published: 20 July 2011 Publication History

Abstract

We show that the full PCF language can be encoded in L_rec, a syntactically linear λ-calculus extended with numbers, pairs, and an unbounded recursor that preserves the syntactic linearity of the calculus. We give call-by-name and call-by-value evaluation strategies and discuss implementation techniques for L_rec, exploiting its linearity.

References

[1]

S. Abramsky. Computational Interpretations of Linear Logic. Theoretical Computer Science, 111:3--57, 1993.

Digital Library

[2]

S. Alves. Linearisation of the Lambda Calculus. PhD thesis, Faculty of Science - University of Porto, April 2007.

[3]

S. Alves, M. Fernández, M. Florido, and I. Mackie. Linear recursive functions. In Rewriting, Computation and Proof, volume 4600 of LNCS, pages 182--195. Springer, 2007.

Digital Library

[4]

S. Alves, M. Fernández, M. Florido, and I. Mackie. Gödel's system T revisited. Theor. Comput. Sci., 411(11--13):1484--1500, 2010.

Digital Library

[5]

S. Alves, M. Fernández, M. Florido, and I. Mackie. Linear recursion. CoRR, abs/1001.3368, 2010.

[6]

S. Alves and M. Florido. Weak linearization of the lambda calculus. Theoretical Computer Science, 342(1):79--103, 2005.

Digital Library

[7]

A. Asperti and L. Roversi. Intuitionistic light affine logic. ACM Transactions on Computational Logic, 3(1):137--175, 2002.

Digital Library

[8]

P. Baillot and V. Mogbil. Soft lambda-calculus: a language for polynomial time computation. In Proc. FOSSACS'04, volume 2987 of LNCS, pages 27--41. Springer-Verlag, 2004.

[9]

H. P. Barendregt. The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, 1984.

[10]

U. Berger. Minimisation vs. recursion on the partial continuous functionals. In In the Scope of Logic, Methodology and Philosophy of Science, volume 1 of Synthese Library 316, pages 57--64. Kluwer, 2002.

[11]

U. Berger and H. Schwichtenberg. An inverse of the evaluation functional for typed lambda-calculus. In Proc. Logic in Computer Science (LICS'91), pages 203--211. IEEE Computer Society, 1991.

[12]

G. M. Bierman, A. M. Pitts, and C. V. Russo. Operational properties of Lily, a polymorphic linear lambda calculus with recursion. In Workshop on Higher Order Operational Techniques in Semantics, volume 41 of ENTCS, pages 70--88. Elsevier, 2000.

[13]

G. Boudol, P.-L. Curien, and C. Lavatelli. A semantics for lambda calculi with resources. MSCS, 9(4):437--482, 1999.

Digital Library

[14]

T. Braüner. The Girard translation extended with recursion. In Computer Science Logic, 8th International Workshop, CSL'94, Kazimierz, Poland, volume 933 of Lecture Notes in Computer Science, pages 31--45. Springer, 1994.

Digital Library

[15]

P.-L. Curien. An abstract framework for environment machines. Theor. Comput. Sci., 82(2):389--402, 1991.

Digital Library

[16]

U. Dal Lago. The geometry of linear higher-order recursion. In Proc. Logic in Computer Science (LICS'05), pages 366--375, June 2005.

Digital Library

[17]

J. Egger, R. E. Møgelberg, and A. Simpson. Enriching an effect calculus with linear types. In Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7--11, 2009. Proceedings, volume 5771 of Lecture Notes in Computer Science, pages 240--254. Springer, 2009.

Digital Library

[18]

T. Ehrhard and L. Regnier. The differential lambda-calculus. Theor. Comput. Sci., 309(1--3):1--41, 2003.

Digital Library

[19]

M. Fernández, I. Mackie, and F.-R. Sinot. Closed reduction: explicit substitutions without alpha conversion. MSCS, 15(2):343--381, 2005.

Digital Library

[20]

M. Fernández, I. Mackie, and F.-R. Sinot. Lambda-calculus with director strings. Applicable Algebra in Engineering, Communication and Computing, 15(6):393--437, 2005.

Digital Library

[21]

M. Fernández and N. Siafakas. New developments in environment machines. Electr. Notes Theor. Comput. Sci., 237:57--73, 2009.

Digital Library

[22]

D. R. Ghica. Geometry of synthesis: a structured approach to VLSI design. In POPL, pages 363--375, 2007.

Digital Library

[23]

J. Girard. Light linear logic. Inf. and Comp., 143(2):175--204, 1998.

Digital Library

[24]

J.-Y. Girard. Linear Logic. Theor. Comp. Sci., 50(1):1--102, 1987.

Digital Library

[25]

J.-Y. Girard. Towards a geometry of interaction. In Categories in Computer Science and Logic: Proc. of the Joint Summer Research Conference, pages 69--108. American Mathematical Society, 1989.

[26]

J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theor. Comp. Sci. Cambridge University Press, 1989.

Digital Library

[27]

J.-Y. Girard, A. Scedrov, and P. J. Scott. Bounded linear logic: A modular approach to polynomial time computability. Theoretical Computer Science, 97:1--66, 1992.

Digital Library

[28]

M. Giunti and V. T. Vasconcelos. A linear account of session types in the pi calculus. In CONCUR, pages 432--446, 2010.

Digital Library

[29]

C. Hankin. An Introduction to Lambda Calculi for Computer Scientists, volume 2. College Publications, 2004. ISBN 0--9543006--5--3.

[30]

M. Hofmann. Linear types and non-size-increasing polynomial time computation. In Proc. Logic in Computer Science (LICS'99). IEEE Computer Society, 1999.

Digital Library

[31]

M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In POPL, pages 185--197, 2003.

Digital Library

[32]

S. Holmström. Linear functional programming. In Proc. of the Workshop on Implementation of Lazy Functional Languages, pages 13--32, 1988.

[33]

K. Honda. Types for dyadic interaction. In CONCUR'93, volume 715 of LNCS, pages 509--523. Springer, 1993.

Digital Library

[34]

A. J. Kfoury. A linearization of the lambda-calculus and consequences. Journal of Logic and Computation, 10(3):411--436, 2000.

[35]

J. W. Klop. Combinatory Reduction Systems. PhD thesis, Mathematisch Centrum, Amsterdam, 1980.

[36]

J. W. Klop. New fixpoint combinators from old. Reflections on Type Theory, 2007.

[37]

J.-W. Klop, V. van Oostrom, and F. van Raamsdonk. Combinatory reduction systems, introduction and survey. Theor. Computer Science, 121:279--308, 1993.

Digital Library

[38]

N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the pi-calculus. In POPL, pages 358--371, 1996.

Digital Library

[39]

Y. Lafont. The linear abstract machine. Theor. Comp. Sci., 59:157--180, 1988.

Digital Library

[40]

Y. Lafont. Soft linear logic and polynomial time. Theoretical Computer Science, 318(1--2):163--180, 2004.

Digital Library

[41]

I. Mackie. Lilac: A functional programming language based on linear logic. Journal of Functional Programming, 4(4):395--433, 1994.

[42]

I. Mackie. The geometry of interaction machine. In Principles of Programming Languages (POPL), pages 198--208. ACM Press, 1995.

Digital Library

[43]

R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, I. Information and Computation, 100(1):1 -- 40, 1992.

Digital Library

[44]

E. Nöcker, J. Smetsers, M. van Eekelen, and M. Plasmeijer. Concurrent clean. In PARLE'91, volume 506 of LNCS, pages 202--219. Springer, 1991.

Digital Library

[45]

L. Paolini and M. Piccolo. Semantically linear programming languages. In PPDP, pages 97--107, Valencia, Spain, 2008. ACM.

Digital Library

[46]

G. D. Plotkin. LCF Considered as a Programming Language. Theoretical Computer Science, 5:223--255, 1977.

[47]

K. Terui. Light affine calculus and polytime strong normalization. In Proc. Logic in Comp Sci. (LICS'01). IEEE Computer Society, 2001.

[48]

A. v. Tonder. A lambda calculus for quantum computation. SIAM J. Comput., 33(5):1109--1135, 2004.

Digital Library

[49]

P. Wadler. Linear types can change the world! In IFIP TC 2 Conf. on Progr. Concepts and Methods, pages 347--359. North Holland, 1990.

[50]

D. Walker. Substructural type systems. In Adv. Topics in Types and Progr. Languages, chapter 1, pages 3--43. MIT Press, Cambridge, 2005.

[51]

K. Wansbrough and S. P. Jones. Simple usage polymorphism. In Proc. ACM SIGPLAN Workshop on Types in Compilation. ACM Press, 2000.

[52]

N. Yoshida, K. Honda, and M. Berger. Linearity and bisimulation. In FoSSaCS, LNCS, pages 417--434. Springer-Verlag, 2002.

Digital Library

Cited By

Alves SVentura D(2022)Quantitative Weak LinearisationTheoretical Aspects of Computing – ICTAC 202210.1007/978-3-031-17715-6_7(78-95)Online publication date: 3-Oct-2022
https://doi.org/10.1007/978-3-031-17715-6_7
Fairweather EFernández M(2018)Typed Nominal RewritingACM Transactions on Computational Logic (TOCL)10.1145/316155819:1(1-46)Online publication date: 8-Feb-2018
https://dl.acm.org/doi/10.1145/3161558
Gan ETov JMorrisett G(2015)Type Classes for Lightweight Substructural TypesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.176.4176(34-48)Online publication date: 16-Feb-2015
https://doi.org/10.4204/EPTCS.176.4

Index Terms

Linearity and recursion in a typed Lambda-calculus
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus

Recommendations

Normalization for the Simply-Typed Lambda-Calculus in Twelf

Normalization for the simply-typed @l-calculus is proven in Twelf, an implementation of the Edinburgh Logical Framework. Since due to proof-theoretical restrictions Twelf Tait's computability method does not seem to be directly usable, a syntactical ...
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F

We formalize in the logical framework ATS/LF a proof based on Tait's method that establishes the simply-typed lambda-calculus being strongly normalizing. In this formalization, we employ higher-order abstract syntax to encode lambda-terms and an ...
Lambda calculus with explicit recursion

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

PPDP '11: Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming

July 2011

202 pages

ISBN:9781450307765

DOI:10.1145/2003476

General Chair:
Peter Schneider-Kamp
University of Southern Denmark
,
Program Chair:
Michael Hanus
University of Kiel, Germany

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

University of Southern Denmark
Danish Agency for Science Technology and Innovation: DASTI

In-Cooperation

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 20 July 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PPDP '11

Sponsor:

Danish Agency for Science Technology and Innovation

PPDP '11: Symposium on Principles and Practices of Declarative Programming

July 20 - 22, 2011

Odense, Denmark

Acceptance Rates

Overall Acceptance Rate 230 of 486 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
217
Total Downloads

Downloads (Last 12 months)9
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Alves SVentura D(2022)Quantitative Weak LinearisationTheoretical Aspects of Computing – ICTAC 202210.1007/978-3-031-17715-6_7(78-95)Online publication date: 3-Oct-2022
https://doi.org/10.1007/978-3-031-17715-6_7
Fairweather EFernández M(2018)Typed Nominal RewritingACM Transactions on Computational Logic (TOCL)10.1145/316155819:1(1-46)Online publication date: 8-Feb-2018
https://dl.acm.org/doi/10.1145/3161558
Gan ETov JMorrisett G(2015)Type Classes for Lightweight Substructural TypesElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.176.4176(34-48)Online publication date: 16-Feb-2015
https://doi.org/10.4204/EPTCS.176.4

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten