The join calculus: A language for distributed mobile programming
From MaRDI portal
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cited in
(33)- On the expressiveness of internal mobility in name-passing calculi
- Inheritance in the join calculus.
- A hierarchy of equivalences for asynchronous calculi
- Secure implementation of channel abstractions
- Chemical foundations of distributed aspects
- Coupled similarity: the first 32 years
- Distributability of mobile ambients
- A calculus of branching processes
- A formal approach to the engineering of domain-specific distributed systems
- New up-to techniques for weak bisimulation
- Types and full abstraction for polyadic -calculus
- Ensuring termination by typability
- Reversibility in the higher-order \(\pi\)-calculus
- Structuring operational semantics: simplification and computation
- A parametric calculus for mobile open code
- Programming languages for interactive computing
- A formal environment model for multi-agent systems
- Agent Environment and Knowledge in Distributed Join Calculus
- scientific article; zbMATH DE number 1231691 (Why is no real title available?)
- A model of context-dependent component connectors
- Some results in the join-calculus
- Parallelism, concurrency and distribution in constraint handling rules: a survey
- Proof-relevant \(\pi\)-calculus: a constructive account of concurrency and causality
- scientific article; zbMATH DE number 7453965 (Why is no real title available?)
- Strand algebras for DNA computing
- Containment in Rule-Based Models
- Bisimulations in the join-calculus
- The reflective higher-order calculus: encodability, typability and separation
- Encodability and separation for a reflective higher-order calculus
- Programming and reasoning about actors that share state
- Behavioral interface description of an object-oriented language with futures and promises
- An efficient abstract machine for safe ambients
- Using bisimulation proof techniques for the analysis of distributed abstract machines
This page was built for publication: The join calculus: A language for distributed mobile programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4813226)
