Issues in the design of a parallel object-oriented language
Formal Aspects of Computing
Bisimulation through probabilistic testing
Information and Computation
Process algebra semantics of POOL
Empowering networks
A calculus of mobile processes, I
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
A language with distributed scope
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of the ACM (JACM)
Information and Computation
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimilarity for a first-order calculus of objects with subtyping
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interpretation of objects and object types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
An interpretation of typed objects into typed &pgr;-calculus
Information and Computation
Partial confluence of processes and systems of objects
Theoretical Computer Science
The name discipline of uniform receptiveness
Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Lazy functions and mobile processes
Proof, language, and interaction
Communication and Concurrency
A Theory of Objects
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A pi-Calculus Semantics for an Object-Based Design Notation
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Principal Typing Schemes in a Polyadic pi-Calculus
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
On Transformations of Concurrent Object Programs
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Compilation and Equivalence of Imperative Objects
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
A Typing System for a Calculus of Objects
Proceedings of the First JSSST International Symposium on Object Technologies for Advanced Software
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear uniform receptiveness in a pi-calculus with location failures
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Dynamic access control in a concurrent object calculus
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Bisimulations for untyped imperative objects
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
| Hi-index | 0.00 |
An interpretation of Abadi and Cardelli's first-order Imperative ç-calculus into a typed π-calculus is presented. The interpretation validates the subtyping relation and the typing judgments of the ç-calculus, and is computationally adequate. The proof of computational adequacy makes use of (a π-calculus version) of ready simulation, and of a factorization of the interpretation into a functional part and a very simple imperative part. The interpretation can be extended to accommodate various type features. The interpretation can be used to compare and contrast the Imperative and the Functional ç-calculus, and to prove properties about them, within a unified framework.