Author:
Danvy Olivier,Millikin Kevin,Munk Johan,Zerny Ian
Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Ager, M.S., Danvy, O., Midtgaard, J.: A functional correspondence between call-by-need evaluators and lazy abstract machines. Information Processing Letters 90(5), 223–232 (2004)
2. Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. Journal of Functional Programming 7(3), 265–301 (1997)
3. Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. In: Studies in Logic and the Foundation of Mathematics, revised edn., vol. 103, North-Holland, Amsterdam (1984)
4. Biernacka, M., Danvy, O.: A syntactic correspondence between context-sensitive calculi and abstract machines. Theoretical Computer Science 375(1-3), 76–108 (2007)
5. Bloo, R., Rose, K.H.: Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection. In: CSN 1995: Computer Science in the Netherlands, pp. 62–72 (1995)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A sequent calculus with dependent types for classical arithmetic;Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science;2018-07-09
2. A Semantic Approach to Data Reduction for Weighted Graphs and Complex Queries;International Journal of Semantic Computing;2018-06
3. Classical By-Need;Programming Languages and Systems;2016
4. Defunctionalizing push arrays;Proceedings of the 3rd ACM SIGPLAN workshop on Functional high-performance computing - FHPC '14;2014
5. Three syntactic theories for combinatory graph reduction;ACM Transactions on Computational Logic;2013-11