Yuxin Deng, Davide Sangiorgi  Home/Search
Context
Related
| pps.jussieu.fr/~yuxin/p...typeshort.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: pps.jussieu.fr/~yuxin/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed -calculus processes. The systems are obtained by successive refinements of the types of the simply typed -calculus. For all (but one of) the type systems we also present upper bounds to the number of steps well-typed processes take to terminate. The termination proofs use techniques from term rewriting systems. (Update)
Active bibliography (related documents): More All
1.3: Ensuring Termination by Typability - Deng, Sangiorgi (Correct)
0.2: On Type Inference in the - Intersection Type Discipline (Correct)
0.2: On Type Inference in the Intersection Type Discipline - Boudol, Zimmer (2004) (Correct)
Similar documents based on text: More All
0.3: Towards an Algebraic Theory of Typed Mobile Processes - Deng, Sangiorgi (Correct)
0.2: On Bisimulations for the Asynchronous π-Calculus - Amadio, Castellani, Sangiorgi (1996) (Correct)
0.2: Behavioral Equivalence in the Polymorphic Pi-Calculus - Pierce, Sangiorgi (1997) (Correct)
BibTeX entry: (Update)
@misc{ deng-ensuring,
author = "Yuxin Deng and Davide Sangiorgi",
title = "Ensuring Termination by Typability",
url = "citeseer.ist.psu.edu/726433.html" }
Citations (may not include all citations):788 Rewrite systems - Dershowitz, Jouannaud - 1990
194 Functions as processes (context) - Milner - 1992
178 Communicating and Mobile Systems: the -Calculus (context) - Milner - 1999
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
149 calculus: A tutorial (context) - Milner - 1993
81 calculus: a Theory of Mobile Processes (context) - Sangiorgi, Walker - 2001
73 Comparing the expressive power of the synchronous and asynch.. - Palamidessi - 2003
53 Theoretical Computer Science (context) - Dershowitz, Hoot - 1995
38 The Join-Calculus: A Calculus for Distributed Mobile Program.. (context) - Fournet - 1998
28 Proofs of strong normalization (context) - Gandy - 1980
26 calculus semantics for an object-based design notation (context) - Jones - 1993
19 good' encoding of guarded choice (context) - Nestmann - 2000
9 calculus is not elementary recursive (context) - Statman - 1979
7 calculus at work: A proof of Jones's parallelisation theorem.. (context) - Sangiorgi - 1999
6 Notes on simply typed lambda calculus (context) - Loader - 1998
5 On strong normalization in the intersection type discipline - Boudol - 2003
2 Mathematical background (context) - Bezem - 2003
1 Available from ftp://ftp-sop (context) - Sangiorgi, processes - 2001
1 Strong normalisation in the pi-calculus - Yoshida, Berger et al. - 2001
Documents on the same site (http://www.pps.jussieu.fr/~yuxin/): More
Metrics for Action-labelled Quantitative Transition Systems - Deng, Chothia.. (2005) (Correct)
Towards an Algebraic Theory of Typed Mobile Processes - Deng, Sangiorgi (Correct)
Axiomatizations for Probabilistic Finite-State Behaviors - Deng, Palamidessi (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC