The hidden computation steps of turbo abstract state machines

DOI10.1007/3-540-36498-6_14MaRDI QIDQ4413682zbMATH OpenFDO

Authors Nicu G. Fruja, Robert F. Stärk

Publication date 21 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2589/25890244.htm, http://hdl.handle.net/20.500.11850/68770

Mathematics Subject Classification ID

Recommendations

• Remarks on turbo ASMs for functional equations and recursion schemes
• Abstract state machines capture parallel algorithms
• Abstract State Machines 2004. Advances in Theory and Practice
• Abstract state machines: a unifying view of models of computation and of system design frameworks
• Composition and submachine concepts for sequential ASMs

Cited in

(4)

• Abstract state machines: a unifying view of models of computation and of system design frameworks
• Remarks on turbo ASMs for functional equations and recursion schemes
• A high-level modular definition of the semantics of C\(_{\sharp}\)
• Abstract State Machines 2004. Advances in Theory and Practice

This page was built for publication: The hidden computation steps of turbo abstract state machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413682)