Author:
Accattoli Beniamino,Barenbaum Pablo,Mazza Damiano
Publisher
Springer International Publishing
Reference30 articles.
1. Abramsky, S., Ong, C.L.: Full abstraction in the lazy lambda calculus. Inf. Comput. 105(2), 159–267 (1993)
2. Accattoli, B.: An abstract factorization theorem for explicit substitutions. In: RTA, pp. 6–21 (2012)
3. Accattoli, B., Barenbaum, P., Mazza, D.: Distilling abstract machines. In: ICFP, pp. 363–376 (2014)
4. Accattoli, B., Barenbaum, P., Mazza, D.: A strong distillery. CoRR abs/1509.00996 (2015).
http://arxiv.org/abs/1509.00996
5. Accattoli, B., Bonelli, E., Kesner, D., Lombardi, C.: A nonstandard standardization theorem. In: POPL, pp. 659–670 (2014)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic;Logical Methods in Computer Science;2023-12-14
2. A strong call-by-need calculus;Logical Methods in Computer Science;2023-03-24
3. A Diamond Machine for Strong Evaluation;Programming Languages and Systems;2023
4. Crumbling Abstract Machines;Proceedings of the 21st International Symposium on Principles and Practice of Programming Languages 2019;2019-10-07
5. Abstract machines for Open Call-by-Value;Science of Computer Programming;2019-10