Ensuring Termination by Typability-Reference-Cited by-同舟云学术

Ensuring Termination by Typability

Published: Issue: Volume: Page:619-632
ISSN:
Container-title:IFIP International Federation for Information Processing
language:
Short-container-title:

Author:

Deng Yuxin,Sangiorgi Davide

Publisher

Kluwer Academic Publishers

Link

http://link.springer.com/content/pdf/10.1007/1-4020-8141-3_47.pdf

Reference19 articles.

1. M. Bezem. Mathematical background. In M. Bezem, J. Klop, and R. de Vrijer, editors, Term Rewriting Systems, pages 790–825. Cambridge University Press, 2003.

2. G. Boudol. On strong normalization in the intersection type discipline. LNCS, 2701:60–74, 2003.

3. N. Dershowitz and C. Hoot. Natural termination. Theoretical Computer Science, 142(2): 179–207, 1995.

4. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Hand-book of Theoretical Computer Science, chapter 6, pages 243–320. North-Holland, Amsterdam, 1990.

5. N. Dershowitz and Z. Manna. Proving termination with multiset orderings. Communications of the ACM, 22(8):465–476, 1979.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. sMALL CaPS: An Infinitary Linear Logic for a Calculus of Pure Sessions;Proceedings of the 26th International Symposium on Principles and Practice of Declarative Programming;2024-09-09

2. Corecursion and Non-divergence in Session-Typed Processes;Trustworthy Global Computing;2014

3. A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract);Programming Languages and Systems;2007

4. Ensuring termination by typability;Information and Computation;2006-07

5. A New Type System for Deadlock-Free Processes;CONCUR 2006 – Concurrency Theory;2006