Author:
Dal Lago Ugo,Martini Simone
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Asperti, A.: On the complexity of beta-reduction. In: Proc. 23rd ACM SIGPLAN Symposium on Principles of Programming Languages, pp. 110–118 (1996)
2. Cambridge Tracts in Theoretical Computer Science;A. Asperti,1998
3. Lecture Notes in Computer Science;U. Lago Dal,2005
4. Dal Lago, U., Martini, S.: An invariant cost model for the lambda calculus (2005) (extended Version) Available at:
http://arxiv.org/cs.LO/0511045
5. de Bruijn, N.G.: Lambda calculus with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem. Indagationes Mathematicae 34(5), 381–392 (1972)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear Additives;Electronic Proceedings in Theoretical Computer Science;2021-12-30
2. The Complexity of Abstract Machines;Electronic Proceedings in Theoretical Computer Science;2017-01-01
3. Authenticated data structures, generically;ACM SIGPLAN Notices;2014-01-13
4. Authenticated data structures, generically;Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages;2014-01-08
5. The geometry of linear higher-order recursion;ACM Transactions on Computational Logic;2009-02