Results 1 -
2 of
2
Abstract State Machines: A unifying view of models of computation and of system design frameworks
- Annals of Pure and Applied Logic
, 2005
"... We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study 1. 1 ..."
Abstract
-
Cited by 9 (5 self)
- Add to MetaCart
We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which—starting from scratch—provide the conceptual basis for a comparative study 1. 1
Turbo ASMs for functional equations and recursion schemes
- CNR, Istituto IEI—Dipartimento di Informatica, Università di
, 2002
"... Abstract. The question raised in [15] is answered how to naturally model widely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully reflect the common intuitive single-agent understanding of recursion. The argument is illustrated by turbo A ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Abstract. The question raised in [15] is answered how to naturally model widely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully reflect the common intuitive single-agent understanding of recursion. The argument is illustrated by turbo ASMs for Mergesort and Quicksort. Using turbo ASMs for returning function values allows one to seamlessly integrate functional description and programming techniques into the high-level ’abstract programming ’ by state transforming ASM rules. 1
