Types in lambda calculi and programming languages-Reference-Cited by-同舟云学术

Types in lambda calculi and programming languages

Published:1990 Issue: Volume: Page:1-35
ISSN:0302-9743
Container-title:ESOP '90
language:
Short-container-title:

Author:

Barendregt Henk,Hemerik Kees

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52592-0_53.pdf

Reference42 articles.

1. Bakel, S. van. [1990] Complete restrictions of the intersection type discipline. To appear in Theoretical Computer Science.

2. Barendregt, H.P. [1984] The lambda calculus, its syntax and semantics, 2-nd revised edition, North Holland Publishing Company, Amsterdam, 1984.

3. [1989] Introduction to generalised type systems, Proceedings 3rd Italian Conference on Theoretical Computer Science, (Eds. A. Bertoni e.a.), World Scientific, Singapore, 1–37.

4. [1990] Functional programming and Lambda Calculus. To appear in Handbook of Theoretical Computer Science, (Ed. J. van Leeuwen), North Holland, Amsterdam.

5. [199-] Lambda calculi with types. To appear in: Handbook of Logic in Computer Science, (Eds. S. Abramsky, D. Gabbai and T. Maibaum), Oxford University Press, Oxford.

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

1. Parametric polymorphism for typed Prolog and λProlog;Lecture Notes in Computer Science;1996

2. Call-by-name, Call-by-value, Call-by-need, and the Linear Lambda Calculus;Electronic Notes in Theoretical Computer Science;1995

3. Communicating contexts: A pragmatic approach to information exchange;Lecture Notes in Computer Science;1995

4. Imagining CLP(Λ,≡αβ);Lecture Notes in Computer Science;1995

5. A unified approach to type theory through a refined λ-calculus;Theoretical Computer Science;1994-12