A self-interpreter of lambda calculus having a normal form-Reference-Cited by-同舟云学术

A self-interpreter of lambda calculus having a normal form

Published:1993 Issue: Volume: Page:85-99
ISSN:0302-9743
Container-title:Computer Science Logic
language:
Short-container-title:

Author:

Berarducci Alessandro,Böhm Corrado

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-56992-8_7.pdf

Reference10 articles.

1. H. P. Barendregt, The Lambda Calculus, Revised edition, North-Holland, Amsterdam 1984.

2. H. P. Barendregt, Self interpretation in lambda calculus, Journal of functional programming 1 (2), 229–239, April 1991.

3. J. A. Bergstra and J. W. Klop, Strong normalization and perpetual reductions in the lambda calculus, J. Inform. Process. Cybernet. 18 (718), 403–417, 1982.

4. C. Böhm and A. Berarducci, Automatic synthesis of typed Λ-programs on term algebras, Theoretical Computer Science 39 (1985), 135–154.

5. C. Böhm and A. Piperno, Characterizing X-separability and one-side-Invertibility in λ-β-Ω-calculus, LICS 88, Edimburgh, Computer Soc. of the IEEE, 1988, 91–101.

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

1. Self-Quotation in a Typed, Intensional Lambda-Calculus;Electronic Notes in Theoretical Computer Science;2018-04

2. Recursive programs in normal form (short paper);Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation - PEPM '18;2018

3. Church Encoding of Data Types Considered Harmful for Implementations;Proceedings of the 26nd 2014 International Symposium on Implementation and Application of Functional Languages;2014-10

4. The self-reduction in lambda calculus;Theoretical Computer Science;2000-03

5. The Impact of the Lambda Calculus in Logic and Computer Science;Bulletin of Symbolic Logic;1997-06