hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Real-Time FRP
Yale University, New Haven, CT, USA.
Yale University, New Haven, CT, USA.
Yale University, New Haven, CT, USA.
2001 (English)In: ICFP '01: Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, New York, NY: ACM Special Interest Group on Computer Science Education, 2001, Vol. 36, 146-156 p.Conference paper, Published paper (Refereed)
Abstract [en]

Functional reactive programming (FRP) is a declarative programming paradigm where the basic notions are continuous, time-varying behaviors and discrete, event-based reactivity. FRP has been used successfully in many reactive programming domains such as animation, robotics, and graphical user interfaces. The success of FRP in these domains encourages us to consider its use in real-time applications, where it is crucial that the cost of running a program be bounded and known before run-time. But previous work on the semantics and implementation of FRP was not explicitly concerned about the issues of cost. In fact, the resource consumption of FRP programs in the current implementation is often hard to predict. As a first step towards addressing these concerns, this paper presents Real-Time FRP (RT-FRP), a statically-typed language where the time and space cost of each execution step for a given program is statically bounded. To take advantage of existing work on languages with bounded resources, we split RT-FRP into two parts: a reactive part that captures the essential ingredients of FRP programs, and a base language part that can be instantiated to any generic programming language that has been shown to be terminating and resource-bounded. This allows us to focus on the issues specific to RT-FRP, namely, two forms of recursion. After presenting the operational explanation of what can go wrong due to the presence of recursion, we show how the typed version of the language is terminating and resource-bounded. Most of our FRP programs are expressible directly in RT-FRP. The rest are expressible via a simple mechanism that integrates RT-FRP with the base language. Copyright 2001 ACM.

Place, publisher, year, edition, pages
New York, NY: ACM Special Interest Group on Computer Science Education, 2001. Vol. 36, 146-156 p.
Series
ACM SIGPLAN Notices, ISSN 0362-1340 ; 10
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:hh:diva-20986DOI: 10.1145/507635.507654ISI: 000172134900015Scopus ID: 2-s2.0-17144431441ISBN: 1-58113-415-0 OAI: oai:DiVA.org:hh-20986DiVA: diva2:588286
Conference
ICFP'01, International Conference on Functional Programming, Florence, Italy, September 3-5, 2001
Note

Funded by DARPA F33615-99-C-3013 and NSF CCR-9900957. W. T. funded by NSF ITR-0113569 and subcontract #8911-48186 from Johns Hopkins University under NSF agreement Grant # EIA-9996430.

Available from: 2013-01-15 Created: 2013-01-14 Last updated: 2015-08-04Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Taha, Walid
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 86 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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