Author:
van Bakel Steffen,Barbanera Franco,Dezani-Ciancaglini Mariangiola,de Vries Fer-Jan
Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. Full abstraction in the lazy lambda calculus;Abramsky;Inform. Comput.,1993
2. Principal type schemes for the strict type assignment system;van Bakel;J. Logic Comput.,1993
3. Types for trees;Barbanera,1998
4. H. Barendregt, The Lambda Calculus. Its Syntax and Semantics, North-Holland, Amsterdam, revised edition, 1984.
5. A filter lambda model and the completeness of type assignment;Barendregt;J. Symbolic Logic,1983
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Extensional and Non-extensional Functions as Processes;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. The infinitary lambda calculus of the infinite eta Böhm trees;Mathematical Structures in Computer Science;2015-08-17
3. Relational Graph Models, Taylor Expansion and Extensionality;Electronic Notes in Theoretical Computer Science;2014-10
4. Lambda Calculus with Types;PERSPECT LOGIC;2009
5. Calculi, types and applications;Theoretical Computer Science;2008-05