A small calculus for concurrent objects
OOPSLA/ECOOP '90 Proceedings of the workshop on Object-based concurrent programming
Compiling with continuations
An efficiency preorder for processes
Acta Informatica
A calculus of mobile processes, I
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Bisimulation for higher-order process calculi
Information and Computation
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
An interpretation of typed objects into typed &pgr;-calculus
Information and Computation
Theory and Practice of Object Systems - Special issue on foundations of object-oriented languages
The name discipline of uniform receptiveness
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Lazy functions and mobile processes
Proof, language, and interaction
Information and Computation
Asynchronous process calculi: the first-and higher-order paradigms
Theoretical Computer Science - Special issues on models and paradigms for concurrency
Bisimulations in the join-calculus
Theoretical Computer Science
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Mobile objects as mobile processes
Information and Computation - IFIP TCS2000
Action Calculi, or Syntactic Action Structures
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Some Results in the Joint-Calculus
TACS '97 Proceedings of the Third International Symposium on Theoretical Aspects of Computer Software
Pi-Calculus Semantics of Object-Oriented Programming Languages
TACS '91 Proceedings of the International Conference on Theoretical Aspects of Computer Software
Replication in Concurrent Combinators
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
The Update Calculus (Extended Abstract)
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A Labelled Transition Systems for pi-epsilon-Calculus
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
On Transformations of Concurrent Object Programs
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Implicit Typing à la ML for the Join-Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Testing Theories for Asynchronous Languages
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
Imperative objects and mobile processes
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Some Chemical Abstract Machines
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
A Proof Theoretical Approach to Communication
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Types, or: Where's the Difference Between CCS and pi?
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Role-based access control for a distributed calculus
Journal of Computer Security - Special issue on CSFW17
Matching Systems for Concurrent Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Responsiveness in process calculi
Theoretical Computer Science
A Symbolic Semantics for a Calculus for Service-Oriented Computing
Electronic Notes in Theoretical Computer Science (ENTCS)
Security Abstractions and Intruder Models (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Observational Theory of the CPS-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Channel abstractions for network security†
Mathematical Structures in Computer Science
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
Regulating data exchange in service oriented applications
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
COWS: a timed service-oriented calculus
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Responsiveness in process calculi
ASIAN'06 Proceedings of the 11th Asian computing science conference on Advances in computer science: secure software and related issues
Secrecy and authenticity types for secure distributed messaging
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Towards concurrent type theory
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Welcome to the jungle: a subjective guide to mobile process calculi
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Compositional event structure semantics for the internal π-calculus
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Duality and i/o-types in the π-calculus
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Deadlock-freedom-by-design: multiparty asynchronous global programming
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
| Hi-index | 0.00 |
The asynchronous $\pi$-calculus has been considered as the basis of experimental programming languages (or proposals for programming languages) like Pict, Join and TyCO. However, on closer inspection, these languages are based on an even simpler calculus, called Localised $\pi$ (L$\pi$), where: (a) only the output capability of names may be transmitted; (b) there is no matching or similar constructs for testing equality between names.We study the basic operational and algebraic theory of L$\pi$. We focus on bisimulation-based behavioural equivalences, more precisely, on barbed congruence. We prove two coinductive characterisations of barbed congruence in L$\pi$, and some basic algebraic laws. We then show applications of this theory, including: the derivability of the delayed input; the correctness of an optimisation of the encoding of call-by-name $\lambda$-calculus; the validity of some laws for Join; the soundness of Thielecke's axiomatic semantics of the Continuation Passing Style calculus.