Author:
Honda Yuki,Nakazawa Koji,Fujita Ken-etsu
Publisher
Springer Science and Business Media LLC
Subject
History and Philosophy of Science,Logic
Reference9 articles.
1. Baba, K., S. Hirokawa, and K. Fujita, Parallel reduction in type free $$\lambda \mu $$-calculus, Electronic Notes in Theoretical Computer Science 42:52–66, 2001.
2. Dehornoy, P., and V. van Oostrom, Z. Proving confluence by monotonic single-step upperbound functions, in Logical Models of Reasoning and Computation (LMRC-08), 2008.
3. Fujita, K., Explicitly typed $$\lambda \mu $$-calculus for polymorphism and call-by-value, in Typed Lambda Calculi and Applications, 4th International Conference (TLCA 1999), volume 1581 of Lecture Notes in Computer Science, 1999, pp. 162–176.
4. Fujita, K., Domain-free $$\lambda \mu $$-calculus, Theoretical Informatics and Applications 34:433–466, 2000.
5. Nakazawa, K., Confluency and strong normalizability of call-by-value $$\lambda \mu $$-calculus, Theoretical Computer Science 290:429–463, 2003.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Z property for the shuffling calculus;Mathematical Structures in Computer Science;2022-08