Publisher
Springer International Publishing
Reference33 articles.
1. Accattoli, B., Graham-Lengrand, S., Kesner, D.: Tight typings and split bounds, fully developed. J. Funct. Program. 30, e14 (2020)
2. Lecture Notes in Computer Science;B Accattoli,2018
3. Lecture Notes in Computer Science;B Accattoli,2019
4. Alves, S.: Linearisation of the lambda calculus. Ph.D. thesis, University of Porto (2007)
5. Alves, S., Fernández, M., Florido, M., Mackie, I.: Linearity and recursion in a typed lambda-calculus. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming, pp. 173–182. ACM (2011)