A Variadic Extension of Curry's Fixed-Point Combinator-Reference-Cited by-同舟云学术

A Variadic Extension of Curry's Fixed-Point Combinator

Published:2005-12 Issue:3-4 Volume:18 Page:371-388
ISSN:1388-3690
Container-title:Higher-Order and Symbolic Computation
language:en
Short-container-title:Higher-Order Symb Comput

Author:

Goldberg Mayer

Publisher

Springer Science and Business Media LLC

Subject

Computer Science Applications,Software

Link

http://link.springer.com/content/pdf/10.1007/s10990-005-4881-8.pdf

Reference14 articles.

1. Abelson, H., Jay Sussman, G., and Sussman, J. Structure and Interpretation of Computer Programs. The MIT Press, McGraw-Hill Book Company, Second edition, 1996.

2. Barendregt, H.P. The Lambda Calculus, Its Syntax and Semantics. North-Holland, 1984.

3. Barendregt, H.P. Functional programming and the λ-calculus. In Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.), chapter 7. MIT Press, Cambridge, Massachusetts, 1990, pp. 323–363.

4. Bekič, H. Programming Languages and Their Definition. Number 177 in Lecture Notes in Computer Science. Springer-Verlag, 1984.

5. Curry, H.B., Feys, R., and Craig, W. Combinatory Logic, volume I. North-Holland Publishing Company, 1958.

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

1. Unraveling Recursion: Compiling an IR with Recursion to System F;Lecture Notes in Computer Science;2019

2. Ellipses and Lambda Definability;Logical Methods in Computer Science;2015-10-01

3. Simulation in the Call-by-Need Lambda-Calculus with Letrec, Case, Constructors, and Seq;Logical Methods in Computer Science;2015-03-16

4. The First-Order Syntax of Variadic Functions;Notre Dame Journal of Formal Logic;2013-01-01

5. SIMULATION IN THE CALL-BY-NEED LAMBDA-CALCULUS WITH LETREC;LEIBNIZ INT PR INFOR;2010