Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.

DOI10.1006/inco.2000.2872zbMath1046.68620OpenAlexW2050084141MaRDI QIDQ1854358

Atsushi Igarashi, Naoki Kobayashi

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7c9cd4390a611c60bec9c1da5f13a4bfb2e22989

zbMATH Keywords

concurrent languagescompile-time optimizations

Mathematics Subject Classification ID

Theory of programming languages (68N15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (10)

Modular Inference of Linear Types for Multiplicity-Annotated Arrows ⋮ A generic type system for the pi-calculus ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ Termination in a π-calculus with subtyping ⋮ Backwards type analysis of asynchronous method calls ⋮ Hard Life with Weak Binders ⋮ Analysing input/output-capabilities of mobile processes with a generic type system ⋮ Type-Based Analysis for Session Inference (Extended Abstract) ⋮ Assigning types to processes ⋮ Type-based information flow analysis for the \(\pi\)-calculus

Uses Software

• ABCL

Cites Work

• Unnamed Item
• Type inference with subtypes
• Static and dynamic processor allocation for higher-order concurrent languages
• A Machine-Oriented Logic Based on the Resolution Principle
• An algorithm for analyzing communicating processes

This page was built for publication: Type reconstruction for linear \(\pi\)-calculus with I/O subtyping.