hh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Generating Heap-bounded Programs in a Functional Setting
Rice University, Houston, TX, USA.
Rice University, Houston, TX, USA.
Boston University, Boston, MA, USA.
2003 (Engelska)Ingår i: Embedded Software: Third International Conference, EMSOFT 2003, Philadelphia, PA, USA, October 13-15, 2003. Proceedings / [ed] Rajeev Alur & Insup Lee, Berlin: Springer Berlin/Heidelberg, 2003, s. 340-355Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

High-level programming languages offer significant expressivity but provide little or no guarantees about resource utilization. Resource-bounded languages provide strong guarantees about the runtime behavior of programs but often lack mechanisms that allow programmers to write more structured, modular, and reusable programs. To overcome this basic tension in language design, this paper advocates taking into account the natural distinction between the development platform and the deployment platform for resource-sensitive software.

To illustrate this approach, we develop the meta-theory for GeHB, a two-level language in which first stage computations can involve arbitrary resource consumption, but the second stage can only involve functional programs that do not require new heap allocations. As an example of a such a second-stage language we use the recently proposed first-order functional language LFPL. LFPL can be compiled directly to malloc-free, imperative C code. We show that all generated programs in GeHB can be transformed into well-typed LFPL programs, thus ensuring that the results established for LFPL are directly applicable to GeHB. © Springer-Verlag Berlin Heidelberg 2003.

Ort, förlag, år, upplaga, sidor
Berlin: Springer Berlin/Heidelberg, 2003. s. 340-355
Serie
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743 ; 2855
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:hh:diva-20977DOI: 10.1007/978-3-540-45212-6_22ISI: 000187498400022Scopus ID: 2-s2.0-0142249983Libris ID: 9466788ISBN: 978-3-540-20223-3 ISBN: 978-3-540-45212-6 OAI: oai:DiVA.org:hh-20977DiVA, id: diva2:588276
Konferens
EMSOFT'03 – International Conference on Embedded Software and Systems, Philadelphia, PA, USA, October 13-15, 2003
Anmärkning

Supported by NSF grants ITR-0113569, CCR-0224244 and CCR-0229480.

Tillgänglig från: 2013-01-15 Skapad: 2013-01-14 Senast uppdaterad: 2018-03-22Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Taha, Walid

Sök vidare i DiVA

Av författaren/redaktören
Taha, Walid
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetricpoäng

doi
isbn
urn-nbn
Totalt: 125 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf