hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Event-Driven FRP
Department of Computer Science, Yale University, New Haven, CT, USA.
Department of Computer Science, Yale University, New Haven, CT, USA.
Department of Computer Science, Yale University, New Haven, CT, USA.
2002 (English)In: Practical Aspects of Declarative Languages: 4th International Symposium, PADL 2002 Portland, OR, USA, January 19–20, 2002 Proceedings / [ed] Shriram Krishnamurthi & C. R. Ramakrishnan, Berlin: Springer Berlin/Heidelberg, 2002, p. 155-172Conference paper, Published paper (Refereed)
Abstract [en]

Functional Reactive Programming (FRP) is a high-level declarative language for programming reactive systems. Previous work on FRP has demonstrated its utility in a wide range of application domains, including animation, graphical user interfaces, and robotics. FRP has an elegant continuous-time denotational semantics. However, it guarantees no bounds on execution time or space, thus making it unsuitable for many embedded real-time applications. To alleviate this problem, we recently developed Real-Time FRP (RT-FRP), whose operational semantics permits us to formally guarantee bounds on both execution time and space.

In this paper we present a formally verifiable compilation strategy from a new language based on RT-FRP into imperative code. The new language, called Event-Driven FRP (E-FRP), is more tuned to the paradigm of having multiple external events. While it is smaller than RT-FRP, it features a key construct that allows us to compile the language into efficient code. We have used this language and its compiler to generate code for a small robot controller that runs on a PIC16C66 micro-controller. Because the formal specification of compilation was crafted more for clarity and for technical convenience, we describe an implementation that produces more efficient code.

Place, publisher, year, edition, pages
Berlin: Springer Berlin/Heidelberg, 2002. p. 155-172
Series
Lecture Notes In Computer Science, ISSN 0302-9743 ; 2257
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20983DOI: 10.1007/3-540-45587-6_11Libris ID: 8299432ISBN: 978-3-540-43092-6 ISBN: 978-3-540-45587-5 OAI: oai:DiVA.org:hh-20983DiVA, id: diva2:588284
Conference
PADL'02, 4th International Symposium on Practical Aspects of Declarative Languages
Note

Funded by NSF CCR9900957, NSF ITR-0113569, and DARPA F33615-99-C-3013 and DABT63-00-1-0002.

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2018-03-22Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Taha, Walid

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 104 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf