A semantics preserving actor translation
DOI10.1007/3-540-63165-8_193zbMATH Open1401.68026OpenAlexW1014131874MaRDI QIDQ4571968FDOQ4571968
Authors: Ian A. Mason, Carolyn Talcott
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_193
Recommendations
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55)
Cites Work
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- The chemical abstract machine
- Conditional rewriting logic as a unified model of concurrency
- A foundation for actor computation
- Objects in the \(\pi\)-calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
- Actor languages. Their syntax, semantics, translation, and equivalence
- A formal, resource consumption-preserving translation from actors with cooperative scheduling to Haskell
- A formal, resource consumption-preserving translation of actors to Haskell
- Title not available (Why is that?)
- Rewriting logic: Roadmap and bibliography
This page was built for publication: A semantics preserving actor translation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571968)