See this document in CiteSeerX!

Ensuring Termination by Typability  (Make Corrections)  
Yuxin Deng, Davide Sangiorgi



  Home/Search   Context   Related

 
View or download:
pps.jussieu.fr/~yuxin/pu...typefull.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pps.jussieu.fr/~yuxin/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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. We show the usefulness of the type systems on... (Update)

Active bibliography (related documents):   More   All
1.3:   Ensuring Termination by Typability - Deng, Sangiorgi   (Correct)
0.5:   Sequence Types for the π-calculus - Maffeis (2004)   (Correct)
0.2:   CLL: A Concurrent Language Built from Logical Principles - Garg (2005)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ deng-ensuring,
  author = "Yuxin Deng and Davide Sangiorgi",
  title = "Ensuring Termination by Typability",
  url = "citeseer.ist.psu.edu/738798.html" }
Citations (may not include all citations):
788   Rewrite systems - Dershowitz, Jouannaud - 1990
325   Towards a theory of type structure (context) - Reynolds - 1974
178   Communicating and Mobile Systems: the #-Calculus (context) - Milner - 1999
151   Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
114   The Polymorphic Pi-Calculus: Theory and Implementation - Turner - 1996
97   Mathematical Structures in Computer Science (context) - Milner, processes - 1992
86   A partially deadlock-free typed process calculus - Kobayashi - 1998
81   calculus: a Theory of Mobile Processes (context) - Sangiorgi, Walker - 2001
75   Interpretation Fonctionnelle et Eliminations des Coupures de.. (context) - Girard - 1972
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
23   University of Edinburgh (context) - Milner, -calculus et al. - 1991
22   Principal typing schemes in a polyadic #-calculus - Vasconcelos, Honda - 1993
19   good' encoding of guarded choice (context) - Nestmann - 2000
9   calculus is not elementary recursive (context) - Statman - 1979
8   Mathematical Structures in Computer Science (context) - Sangiorgi, processes - 2006
7   calculus at work: A proof of Jones's parallelisation theorem.. (context) - Sangiorgi - 1999
6   Notes on simply typed lambda calculus (context) - Loader - 1998
6   An introduction to the pi-calculus (context) - Parrow - 2001
5   On strong normalization in the intersection type discipline - Boudol - 2003
4   Mathematical Foundations of Programming (context) - Beckman - 1980
4   Type-based information flow analysis for the pi-calculus - Kobayashi - 2005
2   Genericity and the pi-calculus - Berger, Honda et al. - 2003
2   Mathematical background (context) - Bezem - 2003

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