Turbo ASMs for functional equations and recursion schemes (2002)
| Venue: | CNR, Istituto IEI—Dipartimento di Informatica, Università di |
| Citations: | 1 - 0 self |
BibTeX
@TECHREPORT{Börger02turboasms,
author = {Egon Börger and Tommaso Bolognesi},
title = {Turbo ASMs for functional equations and recursion schemes},
institution = {CNR, Istituto IEI—Dipartimento di Informatica, Università di},
year = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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
