Remarks on Turbo ASMs for Functional Equations and Recursion Schemes

The question raised in [15] is answered how to naturally dely 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 act programming’ by state transforming ASM rules.

• Type: Conference
• Year: 2003
• Where: ASM
• Authors: Egon Börger, Tommaso Bolognesi
• Keywords: ASM 2003, Intuitive Single-agent Understanding, Microbiology, State Transforming Asm, Turbo Asms