Author:
Dal Lago Ugo,Martini Simone
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Andrea Asperti, On the complexity of beta-reduction. in: Proc. 23rd ACM SIGPLAN Symposium on Principles of Programming Languages, 1996, pp. 110–118
2. The Optimal Implementation of Functional Programming Languages;Asperti,1998
3. Sharing in the weak lambda-calculus;Blanc,2005
4. Quantitative models and implicit complexity;Dal~Lago,2005
5. An invariant cost model for the lambda calculus;Dal~Lago,2006
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Light Genericity;Lecture Notes in Computer Science;2024
2. Strong Call-by-Value and Multi Types;Theoretical Aspects of Computing – ICTAC 2023;2023
3. A Diamond Machine for Strong Evaluation;Programming Languages and Systems;2023
4. Towards a Verified Cost Model for Call-by-Push-Value;Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2022-11-29
5. On reduction and normalization in the computational core;Mathematical Structures in Computer Science;2022-08