Weak linearization of the lambda calculus-Reference-Cited by-同舟云学术

Weak linearization of the lambda calculus

Published:2005-09 Issue:1 Volume:342 Page:79-103
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Alves Sandra,Florido Mário

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. S. Abramsky, Computational interpretations of linear logic, Theoret. Comput. Sci., 1993.

2. S. Alves, M. Florido, On the relation between rank 2 intersection types and simple types, in: Joint Conf. on Declarative Programming (AGP’2002), 2002.

3. S. Alves, M. Florido, Linearization by program transformation, in: Logic Based Program Synthesis and Transformation—LOPSTR 2003, revised Selected Papers, Lecture Notes in Computer Science, Vol. 3018, Springer, Berlin, 2004.

4. A. Asperti, V. Danos, C. Laneve, L. Regnier, Paths in the lambda-calculus, in: Logic in Computer Science, 1994, pp. 426–436.

5. Paths, computations and labels in the lambda-calculus;Asperti;Theoret. Comput. Sci.,1995

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantitative Weak Linearisation;Lecture Notes in Computer Science;2022

2. Structural Rules and Algebraic Properties of Intersection Types;Lecture Notes in Computer Science;2022

3. Proceedings Joint International Workshop on Linearity & Trends in Linear Logic and Applications;Electronic Proceedings in Theoretical Computer Science;2019-04-15

4. Geometry of resource interaction and Taylor–Ehrhard–Regnier expansion: a minimalist approach;Mathematical Structures in Computer Science;2016-11-10

5. Linearity: A Roadmap;Journal of Logic and Computation;2012-06-19