PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Boerger E., Bolognesi T. Remarks on Turbo ASMs for Functional Equations and Recursion Schemes. In: Abstract State Machines 2003 - Advances in Theory and Practice (Taormina, Italy, 3-7 March 2003). Proceedings, pp. 218 - 228. Egon Boerger, Angelo Gargantini, Elvinia Riccobene (eds.). (Lecture Notes in Computer Science, vol. 2589). Springer, 2003.
 
 
Abstract
(English)
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.
Subject Abstract State Machines
D.1.1 Applicative (Functional) Programming


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional