@inproceedings{Honda1993TypesFD,
author={Kohei Honda},
booktitle={CONCUR},
year={1993}
}
• Kohei Honda
• Published in CONCUR 23 August 1993
• Computer Science
We formulate a typed formalism for concurrency where types denote freely composable structure of dyadic interaction in the symmetric scheme. The resulting calculus is a typed reconstruction of name passing process calculi. Systems with both the explicit and implicit typing disciplines, where types form a simple hierarchy of types, are presented, which are proved to be in accordance with each other. A typed variant of bisimilarity is formulated and it is shown that typed β-equality has a clean…
429 Citations
Composing processes
It is proved that the class of typable operations in the underlying partial algebras is completely characterised by a certain modularity principle in process composition, which gives the basic understanding on the nature of the type disciplines representable in the proposed construction.
Higher-Order Processes, Functions, and Sessions: A Monadic Integration
• Computer Science
ESOP
• 2013
This paper uniformly integrating a Curry-Howard interpretation of linear sequent calculus as session-typed processes in a functional language via a linear contextual monad that isolates session-based concurrency through a logical foundation for higher-order session typed processes.
Dependent Communication in Type Theory
We present an expressive type system for a language extending the usual λ-calculus with concurrency primitives from the π-calculus. This language uses dependent types as found in type theory,
Session types in concurrent calculi : higher-order processes and objects
This dissertation investigates different formalisms, in the form of programming language calculi, that are aimed at providing a theoretical foundation for structured concurrent programming based on session types, and presents contributions to the theory of sessions, distilled into two families of programming calculi.
A Dependently Typed Linear π-Calculus in Agda
• Computer Science
PPDP
• 2020
This work proposes a variant of the linear π-calculus whose type structure encompasses virtually all dependent session types using just two type constructors: linear channel types and linear dependent pairs.
Strong normalisation in the pi -calculus
• Computer Science, Mathematics
Inf. Comput.
• 2004
This work introduces a typed π-calculus where strong normalisation is ensured by typability, and is one of the first steps to extend theories and proof methods for strong normalisability to the context of name-passing processes.
A process-calculus approach to typed concurrent objects
This work brings into the name-passing paradigm (not restricted to the calculus presented, but encompassing the -calculus and the calculus) the notions of types and type assignment, thus opening the possibility to explore, in the setting of name-Passing calculi, the wide body of results on type systems for -calculi.
π with leftovers: a mechanisation in Agda
• Computer Science
FORTE
• 2021
This work presents the first full mechanisation in Agda of a {\pi}-calculus with linear, graded and shared types, all under the same unified framework, and shows that the type system is stable under substitution and prove subject reduction.
Intersections and Unions of Session Types
• Computer Science
ITRS
• 2016
It is observed that the system can represent internal and external choice by intersection and union, respectively, which was previously suggested by Padovani for a different language of session types motivated by operational rather than logical concerns.
Predicative Polymorphism in Pi-Calculus
The new presentation introduces an operator to express recursion, and an ML-style let-constructor allowing to associate an agent to an agent-variable, and use the latter several times in a program.

References

SHOWING 1-10 OF 30 REFERENCES
Typing and subtyping for mobile processes
• Computer Science
[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
• 1993
The authors define the syntax, typing, subtyping, and operational semantics of their calculus, prove that the typing rules are sound, apply the system to Milner's lambda -calculus encodings, and sketch extensions to higher-order process calculi and polymorphic typing.
Type Systems for Programming Languages
• John C. Mitchell
• Mathematics, Computer Science
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
• 1990
The technique of logical relations is used to prove a semantic completeness theorem and Church–Rosser and strong normalization properties of reduction and encompass basic model-theoretic constructions such as quotients.
Computational Interpretations of Linear Logic
• S. Abramsky
• Mathematics, Computer Science
Theor. Comput. Sci.
• 1993
Girard's linear logic is studied from the point of view of giving a concrete computational interpretation of the logic, based on the Curry—Howard isomorphism, which opens up a promising new approach to the parallel implementation of functional programming languages.
A Theory of Type Polymorphism in Programming
• R. Milner
• Computer Science
J. Comput. Syst. Sci.
• 1978
This work presents a formal type discipline for polymorphic procedures in the context of a simple programming language, and a compile time type-checking algorithm w which enforces the discipline.
A Calculus of Mobile Processes, Part I
We present the -calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily
An Object Calculus for Asynchronous Communication
• Computer Science
ECOOP
• 1991
This paper shows basic construction of the formal system along with several illustrative examples of the communication primitive, which results in a consistent reduction of Milner's calculus, while retaining the same expressive power.
Interaction nets
A new kind of programming language, with the following features: a simple graph rewriting semantics, a complete symmetry between constructors and destructors, and a type discipline for deterministic and deadlock-free (microscopic) parallelism.
A calculus of mobile processes, II
• Computer Science
• 1992
The a-calculus is presented, a calculus of communicating systems in which one can naturally express processes which have changing structure, including the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions.