λ-Terms as total or partial functions on normal forms-Reference-Cited by-同舟云学术

λ-Terms as total or partial functions on normal forms

Published: Issue: Volume: Page:96-121
ISSN:
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Böhm Corrado,Dezani-Ciancaglini Mariangiola

Publisher

Springer-Verlag

Link

http://www.springerlink.com/index/pdf/10.1007/BFb0029521

Reference8 articles.

1. Böhm,C., The CUCH as a Formal and Description Language, Formal Language Description Languages for Computer Programming, ed.T.B. Steel, North-Holland, Amsterdam, (1966), 179–197.

2. Böhm,C., M.Dezani-Ciancaglini, Combinatorial Problems Combinator Equations and Normal Forms, Automata Languages and Programming, ed. J. Loeckx, Lecture Notes in Computer Science, 14, Springer-Verlag, (1974), 185–199.

3. Church,A., J.Barkley Rosser, Some properties of λ-conversion, Trans.Amer. Math Soc., 39, (1936), 472–482.

4. Curry, H.B., J.R. Hindley, J.P. Seldin, Combinatory Logic, 2, North-Holland, Amsterdam, (1972).

5. Knuth, D.E., Examples of Formal Semantics, Symposium on Semantics of Algorithmic Languages, 188, ed. E. Engeler, Springer-Verlag, Berlin, (1970), 212–235.

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

1. Lambda-Calculus and Combinators in the 20th Century;Handbook of the History of Logic;2009

2. Compositional characterisations of λ-terms using intersection types;Theoretical Computer Science;2005-08

3. Two Behavioural Lambda Models;Lecture Notes in Computer Science;2003

4. Compositional Characterizations of λ-Terms Using Intersection Types;Lecture Notes in Computer Science;2000

5. λ-definition of function(al)s by normal forms;Programming Languages and Systems — ESOP '94;1994