Skip to main content

2003 | OriginalPaper | Buchkapitel

Remarks on Turbo ASMs for Functional Equations and Recursion Schemes

verfasst von : Egon Börger, Tommaso Bolognesi

Erschienen in: Abstract State Machines 2003

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Metadaten
Titel
Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
verfasst von
Egon Börger
Tommaso Bolognesi
Copyright-Jahr
2003
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/3-540-36498-6_12

Neuer Inhalt