Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm

Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm

Algebraic dynamic programming is a new method for developing and reasoning about dynamic programming algorithms. In this approach, so-called yield grammars and evaluation algebras constitute abstract specifications of dynamic programming algorithms. We describe how this theory is put to practice by...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Giegerich, Robert, Steffen, Peter
Format: Buchkapitel
Sprache:eng
Schlagworte:
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 20
container_issue
container_start_page 1
container_title
container_volume 2386
creator Giegerich, Robert
Steffen, Peter
description Algebraic dynamic programming is a new method for developing and reasoning about dynamic programming algorithms. In this approach, so-called yield grammars and evaluation algebras constitute abstract specifications of dynamic programming algorithms. We describe how this theory is put to practice by providing a specification language that can both be embedded in a lazy functional language, and translated into an imperative language. Parts of the analysis required for the latter translation also gives rise to source-to-source transformations that improve the asymptotic efficiency of the functional implementation. The multi-paradigm system resulting from this approach provides increased programming productivity and effective validation.
doi_str_mv 10.1007/3-540-45442-X_1
format Book Chapter
fullrecord <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_14574033</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3072977_6_10</sourcerecordid><originalsourceid>FETCH-LOGICAL-p265t-be05099cd030db1a18e9b56eed560019a1f4233b48bea8c5a186845e7f34eae83</originalsourceid><addsrcrecordid>eNpVkEFP3DAQhd3SVmzpnnvNpUeD7bHj-IigC0hI7AGk3qxJMhvSJk5qByT-Pd6FC3MZ6b03T6OPsZ9SnEoh7BlwowXXRmvF_3j5ia2drSBrB8l-ZitZSskBtDti3w8GVMaqL2wlQCjurIZvbOVMZZQGUMdsndJfkQeUtkKvWHszzgONFJY-dMX50FEdsW-Ky5eAY97bOHURx3Hv9qFYHqnYPIVm6aeAQ4GhPUi5hCIu_TN9ONhixLbvxh_s6w6HROv3fcIeNr_vL6757d3VzcX5LZ9VaRZekzDCuabNv7e1RFmRq01J1JpSCOlQ7rQCqHVVE1aNyYGy0obsDjQhVXDCfr31zpgaHHYRQ9MnP8d-xPjipTZWC4Cc42-5lK3QUfT1NP1LXgq_x-7BZ5L-wNhn7Dkv33vj9P-J0uJpf9BkahGH5hHnhWLyIKxy1voyt8Arg_-Aaw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3072977_6_10</pqid></control><display><type>book_chapter</type><title>Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm</title><source>Springer Books</source><creator>Giegerich, Robert ; Steffen, Peter</creator><contributor>Möller, Bernhard ; Boiten, Eerke A ; Boiten, Eerke A. ; Möller, Bernhard</contributor><creatorcontrib>Giegerich, Robert ; Steffen, Peter ; Möller, Bernhard ; Boiten, Eerke A ; Boiten, Eerke A. ; Möller, Bernhard</creatorcontrib><description>Algebraic dynamic programming is a new method for developing and reasoning about dynamic programming algorithms. In this approach, so-called yield grammars and evaluation algebras constitute abstract specifications of dynamic programming algorithms. We describe how this theory is put to practice by providing a specification language that can both be embedded in a lazy functional language, and translated into an imperative language. Parts of the analysis required for the latter translation also gives rise to source-to-source transformations that improve the asymptotic efficiency of the functional implementation. The multi-paradigm system resulting from this approach provides increased programming productivity and effective validation.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540438572</identifier><identifier>ISBN: 9783540438571</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540454427</identifier><identifier>EISBN: 354045442X</identifier><identifier>DOI: 10.1007/3-540-45442-X_1</identifier><identifier>OCLC: 958524332</identifier><identifier>LCCallNum: QA75.5-76.95</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2002, Vol.2386, p.1-20</ispartof><rights>Springer-Verlag Berlin Heidelberg 2002</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3072977-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-45442-X_1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-45442-X_1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=14574033$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Möller, Bernhard</contributor><contributor>Boiten, Eerke A</contributor><contributor>Boiten, Eerke A.</contributor><contributor>Möller, Bernhard</contributor><creatorcontrib>Giegerich, Robert</creatorcontrib><creatorcontrib>Steffen, Peter</creatorcontrib><title>Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm</title><title>Lecture notes in computer science</title><description>Algebraic dynamic programming is a new method for developing and reasoning about dynamic programming algorithms. In this approach, so-called yield grammars and evaluation algebras constitute abstract specifications of dynamic programming algorithms. We describe how this theory is put to practice by providing a specification language that can both be embedded in a lazy functional language, and translated into an imperative language. Parts of the analysis required for the latter translation also gives rise to source-to-source transformations that improve the asymptotic efficiency of the functional implementation. The multi-paradigm system resulting from this approach provides increased programming productivity and effective validation.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540438572</isbn><isbn>9783540438571</isbn><isbn>9783540454427</isbn><isbn>354045442X</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2002</creationdate><recordtype>book_chapter</recordtype><recordid>eNpVkEFP3DAQhd3SVmzpnnvNpUeD7bHj-IigC0hI7AGk3qxJMhvSJk5qByT-Pd6FC3MZ6b03T6OPsZ9SnEoh7BlwowXXRmvF_3j5ia2drSBrB8l-ZitZSskBtDti3w8GVMaqL2wlQCjurIZvbOVMZZQGUMdsndJfkQeUtkKvWHszzgONFJY-dMX50FEdsW-Ky5eAY97bOHURx3Hv9qFYHqnYPIVm6aeAQ4GhPUi5hCIu_TN9ONhixLbvxh_s6w6HROv3fcIeNr_vL6757d3VzcX5LZ9VaRZekzDCuabNv7e1RFmRq01J1JpSCOlQ7rQCqHVVE1aNyYGy0obsDjQhVXDCfr31zpgaHHYRQ9MnP8d-xPjipTZWC4Cc42-5lK3QUfT1NP1LXgq_x-7BZ5L-wNhn7Dkv33vj9P-J0uJpf9BkahGH5hHnhWLyIKxy1voyt8Arg_-Aaw</recordid><startdate>2002</startdate><enddate>2002</enddate><creator>Giegerich, Robert</creator><creator>Steffen, Peter</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2002</creationdate><title>Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm</title><author>Giegerich, Robert ; Steffen, Peter</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p265t-be05099cd030db1a18e9b56eed560019a1f4233b48bea8c5a186845e7f34eae83</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2002</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Giegerich, Robert</creatorcontrib><creatorcontrib>Steffen, Peter</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Giegerich, Robert</au><au>Steffen, Peter</au><au>Möller, Bernhard</au><au>Boiten, Eerke A</au><au>Boiten, Eerke A.</au><au>Möller, Bernhard</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm</atitle><btitle>Lecture notes in computer science</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2002</date><risdate>2002</risdate><volume>2386</volume><spage>1</spage><epage>20</epage><pages>1-20</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540438572</isbn><isbn>9783540438571</isbn><eisbn>9783540454427</eisbn><eisbn>354045442X</eisbn><abstract>Algebraic dynamic programming is a new method for developing and reasoning about dynamic programming algorithms. In this approach, so-called yield grammars and evaluation algebras constitute abstract specifications of dynamic programming algorithms. We describe how this theory is put to practice by providing a specification language that can both be embedded in a lazy functional language, and translated into an imperative language. Parts of the analysis required for the latter translation also gives rise to source-to-source transformations that improve the asymptotic efficiency of the functional implementation. The multi-paradigm system resulting from this approach provides increased programming productivity and effective validation.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/3-540-45442-X_1</doi><oclcid>958524332</oclcid><tpages>20</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Lecture notes in computer science, 2002, Vol.2386, p.1-20
issn 0302-9743
1611-3349
language eng
recordid cdi_pascalfrancis_primary_14574033
source Springer Books
subjects Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Theoretical computing
title Implementing Algebraic Dynamic Programming in the Functional and the Imperative Programming Paradigm
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T10%3A54%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Implementing%20Algebraic%20Dynamic%20Programming%20in%20the%20Functional%20and%20the%20Imperative%20Programming%20Paradigm&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Giegerich,%20Robert&rft.date=2002&rft.volume=2386&rft.spage=1&rft.epage=20&rft.pages=1-20&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540438572&rft.isbn_list=9783540438571&rft_id=info:doi/10.1007/3-540-45442-X_1&rft_dat=%3Cproquest_pasca%3EEBC3072977_6_10%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540454427&rft.eisbn_list=354045442X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3072977_6_10&rft_id=info:pmid/&rfr_iscdi=true