Author:
Dal Lago Ugo,Schöpp Ulrich
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Abramsky, S., Jagadeesan, R.: New Foundations for the Geometry of Interaction. Inf. Comput. 111(1), 53–119 (1994)
2. Abramsky, S., Haghverdi, E., Scott, P.J.: Geometry of interaction and linear combinatory algebras. Math. Struct. in Comput. Sci. 12(5), 625–665 (2002)
3. Asperti, A., Guerrini, S.: The optimal implementation of functional programming languages. Cambridge University Press, Cambridge (1998)
4. Baillot, P., Terui, K.: Light types for polynomial time computation in lambda calculus. Inf. Comput. 207(1), 41–62 (2009)
5. Lecture Notes in Computer Science;G. Bonfante,2006
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Implicit computation complexity in higher-order programming languages;Mathematical Structures in Computer Science;2022-03-15
2. The Space of Interaction;2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2021-06-29
3. The (In)Efficiency of interaction;Proceedings of the ACM on Programming Languages;2021-01-04
4. The weak call-by-value λ-calculus is reasonable for both time and space;Proceedings of the ACM on Programming Languages;2020-01
5. A Double Category Theoretic Analysis of Graded Linear Exponential Comonads;Lecture Notes in Computer Science;2018