Remarks on Turbo ASMs for Functional Equations and Recursion Schemes (Articolo in rivista)

Type
Label
  • Remarks on Turbo ASMs for Functional Equations and Recursion Schemes (Articolo in rivista) (literal)
Anno
  • 2003-01-01T00:00:00+01:00 (literal)
Alternative label
  • Boerger E., Bolognesi T. (2003)
    Remarks on Turbo ASMs for Functional Equations and Recursion Schemes
    in Lecture notes in computer science
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Boerger E., Bolognesi T. (literal)
Pagina inizio
  • 218 (literal)
Pagina fine
  • 228 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 2589 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • 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. (literal)
Note
  • ISI Web of Science (WOS) (literal)
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • (1) Dip. di Informatica, Universita' di Pisa (2) CNR-ISTI (literal)
Titolo
  • Remarks on Turbo ASMs for Functional Equations and Recursion Schemes (literal)
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. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it