Publisher
Springer Berlin Heidelberg
Reference36 articles.
1. Lecture Notes in Computer Science;Z. Ariola,2003
2. Ariola, Z., Herbelin, H.: Control Reduction Theories: the Benefit of Structural Substitution. In: JFP. Includes a Historical Note by Matthias Felleisen (2007)
3. Lect. Notes in Pure and App. Math. Series;A. Berarducci,1996
4. Berarducci, A., Dezani, M.: Infinite λ-calculus and types. TCS, 212 (1999)
5. Biernacka, M., Biernacki, D., Danvy, O.: An operational foundation for delimited continuations in the CPS hierarchy. Logical Meth. in Comp. Science 1(2) (2005)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The approximation theorem for the Λμ-calculus;Mathematical Structures in Computer Science;2015-07-28
2. On Subexponentials, Synthetic Connectives, and Multi-level Delimited Control;Logic for Programming, Artificial Intelligence, and Reasoning;2015
3. Reduction System for Extensional Lambda-mu Calculus;Lecture Notes in Computer Science;2014
4. Extensional Models of Untyped Lambda-mu Calculus;Electronic Proceedings in Theoretical Computer Science;2012-10-09
5. Böhm theorem and Böhm trees for the Λμ-calculus;Theoretical Computer Science;2012-06