scientific article

Benjamin C. Pierce, Davide Sangiorgi

Publication date: 8 December 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items (78)

Characteristic bisimulation for higher-order session processes ⋮ Eager functions as processes ⋮ Precise Subtyping for Asynchronous Multiparty Sessions ⋮ Towards a behavioural theory of access and mobility control in distributed systems ⋮ A generic type system for the pi-calculus ⋮ Type inference for record concatenation and subtyping ⋮ PiDuce- A project for experimenting web services technologies ⋮ Session types and subtyping for orchestrated interactions ⋮ A Behavioural Theory for a π-calculus with Preorders ⋮ Behavioural Analysis of Sessions Using the Calculus of Structures ⋮ Reversible client/server interactions ⋮ Contracts for Mobile Processes ⋮ Linear forwarders ⋮ Types and full abstraction for polyadic $\pi$-calculus ⋮ Subtyping Supports Safe Session Substitution ⋮ Name-passing calculi: from fusions to preorders and types ⋮ Orchestrated session compliance ⋮ Strong normalisation in the $\pi$-calculus ⋮ The name discipline of uniform receptiveness (extended abstract) ⋮ On confluence in the π-calculus ⋮ Space-aware ambients and processes ⋮ Symmetries and Dualities in Name-Passing Process Calculi ⋮ πI: A symmetric calculus based on internal mobility ⋮ A behavioural theory for a $\pi$-calculus with preorders ⋮ On implementations and semantics of a concurrent programming language ⋮ Typing correspondence assertions for communication protocols ⋮ Precise subtyping for synchronous multiparty sessions ⋮ An algebra of behavioural types ⋮ Algorithmic type checking for a pi-calculus with name matching and session types ⋮ Partition refinement of component interaction automata ⋮ A simple library implementation of binary sessions ⋮ Observing Success in the Pi-Calculus ⋮ The name discipline of uniform receptiveness ⋮ Semantic subtyping for the pi-calculus ⋮ Linear logical relations and observational equivalences for session-based concurrency ⋮ A taxonomy of process calculi for distribution and mobility ⋮ Internal mobility and agent-passing calculi ⋮ Backwards type analysis of asynchronous method calls ⋮ Typing Correspondence Assertions for Communication Protocols ⋮ Counting the Cost in the Picalculus (Extended Abstract) ⋮ Unnamed Item ⋮ Secrecy and group creation ⋮ The security pi-calculus and non-interference ⋮ Analysing input/output-capabilities of mobile processes with a generic type system ⋮ A process-calculus analysis of concurrent operations on B-trees ⋮ A type system for lock-free processes ⋮ Mobile objects as mobile processes ⋮ Unnamed Item ⋮ A Framework for Type Safe Exchange of Mobile Code ⋮ Linearity and bisimulation ⋮ On Hierarchical Communication Topologies in the $$\pi $$ -calculus ⋮ Typed ψ-calculi ⋮ Full Abstraction in a Subtyped pi-Calculus with Linear Types ⋮ Session-Based Communication Optimisation for Higher-Order Mobile Processes ⋮ A Gentle Introduction to Multiparty Asynchronous Session Types ⋮ An interpretation of typed objects into typed $\pi$-calculus ⋮ On the expressiveness of internal mobility in name-passing calculi ⋮ A calculus for cryptographic protocols: The spi calculus ⋮ Typed behavioural equivalences for processes in the presence of subtyping ⋮ A categorical framework for typing CCS-style process communication ⋮ On modelling mobility ⋮ Types for access control ⋮ Processes against tests: on defining contextual equivalences ⋮ Genericity and the $\pi$-calculus ⋮ MOMI: a calculus for mobile mixins ⋮ Subtyping for session types in the pi calculus ⋮ What is a ``good encoding of guarded choice? ⋮ Type reconstruction for linear $\pi$-calculus with I/O subtyping. ⋮ Static analysis for the $\pi$-calculus with applications to security ⋮ Resource access control in systems of mobile agents ⋮ Assigning types to processes ⋮ Type inference for variant object types ⋮ Type-based information flow analysis for the $\pi$-calculus ⋮ A general framework for types in graph rewriting ⋮ Session typing and asynchronous subtyping for the higher-order $\pi$-calculus ⋮ Types for Access Control in a Calculus of Mobile Resources ⋮ A Rude Contract Language for Web Services ⋮ Towards an algebraic theory of typed mobile processes

This page was built for publication: