Author:
Rizkallah Christine,Garbuzov Dmitri,Zdancewic Steve
Publisher
Springer International Publishing
Reference18 articles.
1. Abramsky, S.: The lazy $$\lambda $$- calculus. In: Research Topics in Functional Programming, pp. 65–116. Addison Wesley (1990)
2. Abramsky, S., Ong, C.H.L.: Full abstraction in the lazy lambda calculus. Inf. Comput. 105(2), 159–267 (1993)
3. Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics. Elsevier Science, New York (2013)
4. Biernacki, D., Lenglet, S., Polesiuk, P.: Proving soundness of extensional normal-form bisimilarities. In: Mathematical Foundations of Program Semantics (MFPS). Electronic Notes in Theoretical Computer Science (2017)
5. Crary, K.: A simple proof of call-by-value standardization. Technical report CMU-CS-09-137, Carnegie Mellon University (2009). https://www.cs.cmu.edu/~crary/papers/2009/standard.pdf
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Normalization by Evaluation for Call-By-Push-Value and Polarized Lambda Calculus;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07
2. Call-by-push-value in Coq: operational, equational, and denotational theory;Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2019;2019
3. POPLMark reloaded: Mechanizing proofs by logical relations;Journal of Functional Programming;2019