Nobuko Yoshida, Martin Berger, Kohei Honda  Home/Search
Context Related
| dcs.qmw.ac.uk/lfp/kohei/pisn.ps.gz 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: dcs.qmw.ac.uk/~kohei/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a typed p-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed l-calculi and linear logic with process-theoretic reasoning. It is adaptable to systems involving state and other extensions. ... (Update)
Cited by: More
Ensuring Termination by Typability - Deng, Sangiorgi (Correct)
Similar documents (at the sentence level):
31.5%: Strong Normalisation in the π-Calculus - Yoshida, Berger, Honda (2001) (Correct)
Active bibliography (related documents): More All
0.4: Sequentiality and the π-Calculus - Berger, Honda, Yoshida (2001) (Correct)
0.3: From Process Logic to Program Logic - Honda (2004) (Correct)
0.3: Channel Dependent Types for Higher-Order Mobile Processes.. - Yoshida (2004) (Correct)
Similar documents based on text: More All
0.5: A Uniform Type Structure for Secure Information Flow - Honda, Yoshida (2002) (Correct)
0.5: Genericity and the π-Calculus - Berger, Honda, Yoshida (Correct)
BibTeX entry: (Update)
N. Yoshida, M. Berger, and K. Honda. Strong normalisation in the pi-calculus. In Logic in Computer Science, pages 311--322, 2001. http://citeseer.ist.psu.edu/article/yoshida01strong.html More
@inproceedings{ yoshida01strong,
author = "Nobuko Yoshida and Martin Berger and Kohei Honda",
title = "Strong Normalisation in the pi-Calculus",
booktitle = "Logic in Computer Science",
pages = "311-322",
year = "2001",
url = "citeseer.ist.psu.edu/article/yoshida01strong.html" }
Citations (may not include all citations):854 Information and Computation (context) - Milner, Parrow et al. - 1992
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
294 An Object Calculus for Asynchronous Communication - Honda, Tokoro - 1991
247 Confluent reductions: Abstract properties and applications t.. (context) - Huet - 1981
242 Linear Logic (context) - Girard - 1987
233 Computational interpretation of linear logic - Abramsky - 1993
229 Foundations for Programming Languages (context) - Mitchell - 1996
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
194 Functions as Processes (context) - Milner - 1992
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1994
149 Calculus: a tutorial (context) - Milner - 1992
146 Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1993
140 On Reduction-Based Process Semantics - Honda, Yoshida - 1995
133 of Cambridge Tracts in Theoretical Computer Science (context) - Girard, Lafont et al. - 1989
123 PLAN: A Packet Language for Active Networks - Hicks, Kakkar et al.
121 Intensional interpretation of functionals of finite type (context) - Tait - 1967
109 Interaction Nets (context) - Lafont - 1990
99 Typed concurrent objects - Vasconcelos - 1994
86 A partially deadlock-free typed process calculus - Kobayashi - 1998
72 The Formal Semantics of Programming Languages: An Introducti.. (context) - Winskel - 1993
68 On Full Abstraction for PCF (context) - Hyland, Ong - 2000
67 Composing Processes - Honda - 1996
66 Language Primitives and Type Discipline for Structured Commu.. - Honda, Kubo et al. - 1998
66 Graph Types for Monadic Mobile Processes - Yoshida - 1996
66 Handbook of Logic in Computer Science (context) - Barendregt - 1992
59 The name discipline of uniform receptiveness - Sangiorgi - 1997
49 Secure Information Flow as Typed Process Behaviour - Honda, Vasconcelos et al. - 2000
48 Types and Subtypes for Client-Server Interactions - Gay, Hole - 1999
48 Types for Dyadic Interaction - Honda - 1993
43 Candidats de Reductibilite (context) - Gallier - 1990
37 A generic type system for the picalculus - Igarashi, Kobayashi - 2001
36 The pi-calculus in direct style - Boudol - 1997
29 Handbook of Logic in Computer Science (context) - Klop - 1992
26 and agent-passing calculi (context) - Sangiorgi - 1996
17 Proofs as Processes (context) - Abramsky - 1994
14 INRIA Research Report (context) - Boudol - 1992
12 Principal Typing Scheme for Polyadic p-Calculus (context) - Vasconcelos, Honda - 1993
11 Type Systems for Concurrent Processes: From Deadlock-Freedom.. (context) - Kobayashi - 2000
9 Linear Types and p- calculus (context) - Kobayashi, Pierce et al. - 1996
9 Sequentiality and the p- Calculus (context) - Berger, Honda et al. - 2001
8 On Synchronous and Asynchronous Mobile Processes (context) - Quaglia, Walker - 2000
6 the Pi-calculus and linear logic - Bellin, Scott - 1994
4 A Tutorial Workshop on Realizability Semantics and Applicati.. (context) - Abramsky - 1999
4 Parallel Reductions in Lambda-Calculus (context) - Takahashi - 1989
4 calculus and Computer Science Theory (context) - Levy, An - 1975
2 Available at www (context) - Berger, Honda et al. - 2001
1 available from http://www (context) - Language, Networks et al.
Documents on the same site (http://www.dcs.qmw.ac.uk/~kohei/): More
An Interaction-based Language and its Typing System - Takeuchi (1994) (Correct)
A Theory of Types for π-Calculus - Honda (1998) (Correct)
Composing Processes - Honda (1996) (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