Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. A. W. Appel. Compiling with continuations. Cambridge University Press, 1992.
2. F. Barbanera and S. Berardi. Continuations and simple types: a strong normalization result. In Proceedings of the ACM SIGPLAN Workshop on Continuations. Report STAN-CS-92-1426, Stanford University, 1992.
3. F. Barbanera and S. Berardi. Extracting constructive content from classical logic via control-like reductions. In M. Bezem and J.F. Groote, editors, Proceedings of the International Conference on on Typed Lambda Calculi and Applications, pages 45–59. Lecture Notes in Computer Science, 664, Springer Verlag, 1993.
4. H.P. Barendregt. The lambda calculus, its syntax and semantics. North-Holland, revised edition, 1984.
5. J.-Y. Girard. A new constructive logic: Classical logic. Mathematical Structures in Computer Science, 1:255–296, 1991.
Cited by
23 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Resource approximation for the λμ-calculus;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
2. Programming and Proving with Classical Types;Programming Languages and Systems;2017
3. The approximation theorem for the Λμ-calculus;Mathematical Structures in Computer Science;2015-07-28
4. Reduction System for Extensional Lambda-mu Calculus;Lecture Notes in Computer Science;2014
5. Complexity Analysis in Presence of Control Operators and Higher-Order Functions;Logic for Programming, Artificial Intelligence, and Reasoning;2013