Kohei Honda  Home/Search
Context Related
| dcs.qmw.ac.uk/lfp/kohei/pitype.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 theory of behavioural types as a semantic foundation of typed ß- calculi. The basic idea is that a type is a set of behaviours, represented by name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed variants of well-known processtheoretic operations for mobile processes, and each model of typed ß-calculi in a typed universe induces a compositional theory of typed bisimilarities. The construction... (Update)
Context of citations to this paper: More
...to be equivalent. Typed behavioural equivalences have already been investigated for various process calculi in papers such as [19, 14, 26, 27, 36]. We contend that the existence of the fine grained process types facilitates the development of typed behavioural theories; more...
Cited by: More
Assigning Types to Processes - Yoshida, Hennessy (2000) (Correct)
Assigning Types to Processes (Extended Abstract) - Yoshida, Hennessy (2000) (Correct)
Active bibliography (related documents): More All
1.7: On Behavioural Interpretation of Types in Name Passing Calculi.. - Kohei Honda (Correct)
1.1: Game Theoretic Analysis Of Call-By-Value Computation - Honda (1997) (Correct)
0.7: Behavioural Subtyping in Name Passing Synchronisation Trees - Honda (1999) (Correct)
Similar documents based on text: More All
0.1: Notes On Undirected Actions - Kohei Honda (1997) (Correct)
0.1: An Implementation of LF with Coercive Subtyping & Universes - Callaghan, Luo (Correct)
0.1: Two Bisimilarities in ν-calculus - Honda (Correct)
Related documents from co-citation: More All
4: Subtyping and Locality in Distributed Higher Order Processes - Yoshida, Hennessy - 1999
4: Trust and partial typing in open systems of mobile agents - Riely, Hennessy - 1998
4: Linearity and the pi-calculus - Kobayashi, Pierce et al. - 1996
BibTeX entry: (Update)
Honda, K., A Theory of Types for the pi-calculus, pp.112, Typescript. November, 1998. Available at http://www.dcs.qmw.ac.uk/ kohei. http://citeseer.ist.psu.edu/honda98theory.html More
@misc{ honda98theory,
author = "Kohei Honda",
title = "A theory of types for pi-calculus",
year = "1998",
url = "citeseer.ist.psu.edu/honda98theory.html" }
Citations (may not include all citations):1933 Communication and Concurrency (context) - Milner - 1989
1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
982 Theoretical Computer Science (context) - Girard - 1987
854 Information and Computation (context) - Milner, Parrow et al. - 1992
809 A Theory of Type Polymorphism in Programming (context) - Milner - 1978
484 A Calculus of Communicating Systems (context) - Milner - 1980
357 Algebraic Laws for Nondeterminism and Concurrency (context) - Hennessy, Milner - 1985
342 data abstraction and polymorphism (context) - Cardelli, Wegner - 1985
299 Algebraic Theory of Processes (context) - Hennessy - 1989
294 An Object Calculus for Asynchronous Communication - Honda, Tokoro - 1991
291 A calculus of mobile agents - Fournet, Gonthier et al. - 1996
268 Proofs and Types (context) - Girard, Lafont - 1993
257 Report on the programming language Haskell (context) - Hudak, Peyton et al. - 1992
248 Expressing Mobility (context) - Sangiorgi - 1992
224 Semantics of Programming Languages: Structures and Technique.. (context) - Gunter - 1992
200 Viewing Control Structures as Patterns of Passing Messages (context) - Hewitt - 1977
200 Pict: A Programming Language Based on the Picalculus - Pierce, Turner - 1997
197 Barbed Bisimulation - Milner, Sangiorgi - 1992
175 Games and Full Completeness for Multiplicative Linear Logic - Abramsky, Jagadeesan - 1994
168 Testing Equivalences for Processes (context) - de Nicola, Hennessy - 1984
149 Calculus: a tutorial (context) - Milner - 1992
146 Typing and subtyping for mobile processes - Pierce, Sangiorgi - 1993
144 Full Abstraction for PCF - Abramsky, Jagadeesan et al. - 1995
127 Information and Computation (context) - Walker - 1995
102 The SLam calculus: programming with secrecy and integrity - Heintze, Riecke - 1998
97 Mathematical Structure in Computer Science (context) - Milner - 1992
97 North Holland (context) - Freyd, Scedrov - 1990
92 A Behavioral Notion of Subtyping - Likov, Wing - 1994
89 Calculi for Interaction - Milner - 1995
78 Specification and Design (context) - Jones - 1983
75 Domain Theory in Logical Form (context) - Abramsky - 1987
73 Comparing Expressive power of the synchronous and the asynch.. - Palamidessi
69 Geometry of Interaction I: interpretation of System F (context) - Girard - 1989
68 On Full Abstraction for PCF (context) - Hyland, Ong - 1994
67 Composing Processes - Honda - 1996
66 Handbook of Logic in Computer Science (context) - Barendregt - 1992
62 A Calculus of Higher-Order Communicating Systems (context) - Thomsen - 1988
61 The Fusion Calculus: Expressiveness and Symmetry in Mobile P.. - Parrow, Victor - 1998
61 Sequential Algorithms on concrete data structures (context) - Berry, Curien - 1982
60 Decoding Choice Encodings - Nestmann, Pierce - 1996
59 A Bisimulation Method for Cryptographic Protocols - Abadi, Gordon - 1998
58 A Fully Abstract Game Semantics for General References (context) - Abramsky, Honda et al. - 1998
56 Behavioral Equivalence in the Polymorphic PiCalculus - Pierce, Sangiorgi - 1997
56 Game-theoretic Analysis of Call-by-value Computation - Honda, Yoshida - 1997
54 Games and Full Abstraction for a Functional Metalanguage wit.. (context) - McCusker - 1998
51 Sharing and State: a fully abstract game semantics for Ideal.. (context) - Abramsky, McCusker - 1996
46 Modal Specifications (context) - Larsen - 1990
37 dialogue games and PCF (context) - Hyland, Ong - 1995
31 Typing the Use of Resources in a Concurrent Calculus (context) - Boudol - 1997
29 Mathematical Structure in Computer Science (context) - Curien - 1997
28 Enhanced Operational Semantics for Concurrency (context) - Priami - 1995
26 and agent-passing calculi (context) - Sangiorgi - 1996
24 Geometry of Interaction II: deadlock free algorithms (context) - Girard - 1989
23 The Esterel synchronous programming language (context) - Berry, Gonthier - 1992
23 Implicit Typing a la ML for the join-calculus - Fournet, Laneve et al. - 1997
22 Communication Sequential Processes (context) - Hoare - 1985
22 The Use of Static Constructs in a Modal Process Logic - Huttel, Larsen - 1989
22 On Bisimulations for the Asynchronous ß-calculus (context) - Amadio, Castellani et al. - 1996
19 A Typed Calculus of Synchronous Processes - Gay, Nagarajan - 1995
15 Synchronization Trees (context) - Winskel - 1985
12 Control Structures - Mifsud, Milner et al. - 1995
11 Principal Typing Scheme for Polyadic ß-Calculus (context) - Vasconcelos, Honda - 1993
11 Domaines Concrets (context) - Kahn, Plotkin - 1978
11 Asynchrony and the pi-calculus - Boudol - 1992
11 polymorphism and implementation (context) - Turner - 1996
10 Process Structure - Honda - 1995
10 Recursive Types in Games: Axiomatics and Process Representat.. - Fiore, Honda
10 Handbook of Theoretical Computer Science (context) - John, systems et al. - 1990
10 Foundations of Software Science and Computational Structures (context) - Cardelli, Gordon - 1998
10 London Mathematical Society Lecture Notes Series (context) - Girard, Lafont et al. - 1995
8 Lecture Notes in Computer Science (context) - Malacaria, Hankin - 1998
8 Sorts and Types of ß-Calculus (context) - Milner - 1990
6 local subtyping for a distributed ß-calculus (context) - Sewell - 1998
6 The Computer Science and Engineering Handbook (context) - Cardelli - 1997
6 Name-Passing Games (context) - Honda - 1996
5 to appear in Theoretical Computer Science (context) - Gardner - 1995
5 The Semantics of Types in Programming Languages - Gunter - 1994
5 Theory and Formal Methods (context) - Abramsky - 1993
5 Linear Types and ß-calculus (context) - Kobayashi, Pierce et al. - 1996
5 Progress in Theoretical Computer Science Series (context) - Curien - 1993
4 On sharing and determinacy in concurrent systems (context) - Philippou, Walker - 1995
4 Games and abstract machines (context) - Danos, Regnier - 1994
4 Annuals of Pure and Applied Logic (context) - Blass, Semantics - 1992
4 Correspondence between Operational Semantics and Denotationa.. (context) - Ong - 1995
4 Foundations of Software Technology and Theoretical Computer .. (context) - Honda, Yoshida - 1993
3 Cambridge Tracts in Theoretical Computer Science (context) - Baeton, Wejland - 1990
1 Notes on Undirected Actions - Honda - 1997
1 A Polymorphic Type System for the Polyadic ß-Calculus CONCUR (context) - Liu, Walker - 1995
1 Submitted to publication (context) - Honda - 1997
1 Bologna Lecture (context) - Milner - 1997
1 A Sort Inference Algorithm for the Polyadic ß-Calculus Twent.. (context) - Gay - 1993
1 Calculus in Direct Style 24th Annual Symposium on Principles.. (context) - Boudol - 1997
1 Contorl Flow Analysis of ß- Calculus (context) - Bodei, Degano et al. - 1998
1 Constructive Semantics of Esterel: From Theory to Practice (context) - Berry - 1996
1 Secrecy by Typing in Security Protocols Theoretical Aspects .. (context) - Abadi - 1997
1 Language and Interaction: Essays in Honour of Robin Milner (context) - Boudol, Laneve - 1998
Documents on the same site (http://www.dcs.qmw.ac.uk/~kohei/): More
An Interaction-based Language and its Typing System - Takeuchi (1994) (Correct)
Composing Processes - Honda (1996) (Correct)
Two Bisimilarities in ν-calculus - Honda (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