Author:
Bucciarelli Antonio,Ehrhard Thomas,Manzonetto Giulio
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Abramsky, S., Jagadeesan, R., Malacaria, P.: Full abstraction for PCF. Information and Computation 163(2), 409–470 (2000)
2. Amadio, R.M., Curien, P.-L.: Domains and lambda-calculi. Cambridge University Press, New York (1998)
3. Asperti, A., Longo, G.: Categories, types and structures. In: Categories, types and structures, MIT Press, Cambridge (1991)
4. Barendregt, H.P.: The lambda calculus: Its syntax and semantics. North-Holland Publishing Co., Amsterdam (1984)
5. Berline, C.: From computation to foundations via functions and application: The λ-calculus and its webbed models. Theoretical Computer Science 249, 81–161 (2000)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. From Thin Concurrent Games to Generalized Species of Structures;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Why Are Proofs Relevant in Proof-Relevant Models?;Proceedings of the ACM on Programming Languages;2023-01-09
3. From Semantics to Types: the Case of the Imperative lambda-Calculus;Electronic Proceedings in Theoretical Computer Science;2021-12-29
4. Execution time of λ-terms via denotational semantics and intersection types;Mathematical Structures in Computer Science;2017-01-30
5. Transport of finiteness structures and applications;Mathematical Structures in Computer Science;2016-12-05