Author:
Blanc Tomasz,Lévy Jean-Jacques,Maranget Luc
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit substitutions. Journal of Functional Programming 6(2), 299–327 (1996)
2. Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: A call-by-need lambda calculus. In: Proc. 22nd ACM Symposium on Principles of Programming Languages, January 1995, pp. 233–246 (1995)
3. Asperti, A., Coppola, P., Martini, S. (Optimal) duplication is not elementary recursive. Information and Computation 193/1, 21–56 (2004)
4. Asperti, A., Guerrini, S.: The Optimal Implementation of Functional Programming Languages. Cambridge University Press, Cambridge (1999)
5. Barendregt, H.P.: The Lambda Calculus, Its Syntax and Semantics. North-Holland, Amsterdam (1981)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Spirit of Node Replication;Lecture Notes in Computer Science;2021
2. Spinal Atomic Lambda-Calculus;Lecture Notes in Computer Science;2020
3. Live functional programming with typed holes;Proceedings of the ACM on Programming Languages;2019-01-02
4. System F with coercion constraints;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
5. Superdevelopments for Weak Reduction;Electronic Proceedings in Theoretical Computer Science;2010-01-26