Remarks on turbo ASMs for functional equations and recursion schemes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2589, Issue , 2003, Pages 218-228

  Börger, Egon ^a   Bolognesi, Tommaso ^b  

^a UNIVERSITY OF PISA   (Italy)

^b ISTI CNR   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ABSTRACT MACHINES; FUNCTION VALUES; FUNCTIONAL EQUATION; PROGRAMMING TECHNIQUE; QUICKSORT; RECURSION SCHEMES; RECURSIONS; SINGLE-AGENT;

FUNCTIONAL PROGRAMMING;

EID: 35248854413     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36498-6_12     Document Type: Article

References (17)

1. M. Anlauff. XASM - an extensible, component-based abstract state machines language. In Y. Gurevich, P. Kutter, M. Odersky, and L. Thiele, editors, Abstract State Machines: Theory and Applications, volume 1912 of LNCS, pages 69-90. Springer-Verlag, 2000.
2. A. Blass and Y. Gurevich. Abstract State Machines capture parallel algorithms. ACM Transactions on Computational Logic, 3, 2002.
3. A. Blass and Y. Gurevich. Algorithms vs. machines. Bulletin EATCS, 2002.
4. E. Börger. High level system design and analysis using abstract state machines. In D. Hutter, W. Stephan, P. Traverso, and M. Ullmann, editors, Current Trends in Applied Formal Methods (FM-Trends 98), number 1641 in LNCS, pages 1-43. Springer-Verlag, 1999.
5. E. Börger. Computation and specification models. A comparative study. In P. Mosses, editor, Proc. FLoC'02 Workshop Action Semantics and Related Semantic Frameworks, BRICS Series. Department of Computer Science at University of Aarhus, 2002.
6. E. Börger. The origins and the development of the ASM method for high level system design and analysis. J. of Universal Computer Science, 8(1):2-74, 2002.
7. E. Börger and J. Schmid. Composition and submachine concepts for sequential ASMs. In P. Clote and H. Schwichtenberg, editors, Computer Science Logic (Proceedings of CSL 2000), volume 1862 of LNCS, pages 41-60. Springer-Verlag, 2000.
8. E. Börger and R. Stärk. Abstract State Machines. A Method for High-Level System Design and Analysis. Springer-Verlag, 2003.
9. Foundations of Software Engineering Group, Microsoft Research. AsmL. Web pages at http://research.microsoft.com/foundations/AsmL/, 2001.
10. N. G. Fruja and R. F. Stärk. The hidden computation steps of turbo Abstract State Machines. In E. Börger, A. Gargantini, and E. Riccobene, editors, Abstract State Machines 2003. Springer, 2003.
11. Y. Gurevich. Evolving Algebras 1993: Lipari Guide. In E. Börger, editor, Specification and Validation Methods, pages 9-36. Oxford University Press, 1995.
12. Y. Gurevich. Sequential Abstract State Machines capture sequential algorithms. ACM Transactions on Computational Logic, 1(1):77-111, July 2000.
13. Y. Gurevich and M. Spielmann. Recursive Abstract State Machines. J. of Universal Computer Science, 3(4):233-246, 1997.
14. P. Kutter. The formal definition of Anlauff's eXtensible Abstract State Machine. TIK-Report 136, ETH Zürich, June 2002.
15. Y. N. Moschovakis. What is an algorithm? In B. Engquist and W. Schmid, editors, Mathematics Unlimited - 2001 and beyond. Springer, 2001.
16. J. Schmid. Executing ASM specifications with AsmGofer. Web pages at http://www.tydo.de/AsmGofer.
17. X.ASM. Xasm Open Source. Web pages at http://www.xasm.org/, 2001.