Fair reactive programming

Cave, Andrew; Ferreira, Francisco; Panangaden, Prakash; Pientka, Brigitte

doi:10.1145/2535838.2535881

Cited by 29 publications

(41 citation statements)

References 31 publications

(33 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Very recently, Cave et al [8] proposed a type-theoretic constructivization of the modal µ-calculus (without the A modality). In particular, they use inductive and coinductive types instead of a Nakano-style recursive type, and use it to express fairness properties (for example, of schedulers) with types.…”

Section: Related Workmentioning

confidence: 99%

Higher-order functional reactive programming without spacetime leaks

Krishnaswami

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

Functional reactive programming (FRP) is an elegant approach to declaratively specify reactive systems. However, the powerful abstractions of FRP have historically made it difficult to predict and control the resource usage of programs written in this style.In this paper, we give a new language for higher-order reactive programming. Our language generalizes and simplifies prior type systems for reactive programming, by supporting the use of streams of streams, first-class functions, and higher-order operations. We also support many temporal operations beyond streams, such as terminatable streams, events, and even resumptions with first-class schedulers. Furthermore, our language supports an efficient implementation strategy permitting us to eagerly deallocate old values and statically rule out spacetime leaks, a notorious source of inefficiency in reactive programs. Furthermore, these memory guarantees are achieved without the use of a complex substructural type discipline.We also show that our implementation strategy of eager deallocation is safe, by showing the soundness of our type system with a novel step-indexed Kripke logical relation.

show abstract

Section: Related Workmentioning

confidence: 99%

Higher-order functional reactive programming without spacetime leaks

Krishnaswami

2013

Proceedings of the 18th ACM SIGPLAN International Conference on Functional Programming

View full text Add to dashboard Cite

show abstract

“…Work on reasoning about FRP using temporal logics also includes (Sculthorpe and Nilsson 2010), although this setting considered dynamic network structure, as allowed by higher-order arrows. Further properties beyond safety have been expressed in FRP, for instance using a type extension to enforce fairness properties (Cave et al 2014).…”

Section: Temporal Types For Frpmentioning

confidence: 99%

Synthesizing functional reactive programs

Finkbeiner

Klein

Piskač

et al. 2019

Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell

View full text Add to dashboard Cite

Functional Reactive Programming (FRP) is a paradigm that has simplified the construction of reactive programs. There are many libraries that implement incarnations of FRP, using abstractions such as Applicative, Monads, and Arrows. However, finding a good control flow, that correctly manages state and switches behaviors at the right times, still poses a major challenge to developers.An attractive alternative is specifying the behavior instead of programming it, as made possible by the recently developed logic: Temporal Stream Logic (TSL). However, it has not been explored so far how Control Flow Models (CFMs), as synthesized from TSL specifications, can be turned into executable code that is compatible with libraries building on FRP. We bridge this gap, by showing that CFMs are indeed a suitable formalism to be turned into Applicative, Monadic, and Arrowized FRP.We demonstrate the effectiveness of our translations on a real-world kitchen timer application, which we translate to a desktop application using the Arrowized FRP library Yampa, a web application using the Monadic threepenny-gui library, and to hardware using the Applicative hardware description language ClaSH.

show abstract

“…A more flexible alternative to syntactic criteria is to have users annotate the functions' types with information that controls termination and productivity. Approaches in these category include fair reactive programming [19,24,37], clock variables [8,20], and sized types [2]. Sized types are implemented in MiniAgda [3] and in newer versions of Agda, in conjunction with a destructor-oriented (copattern) syntax for corecursion [5].…”

Section: Related Workmentioning

confidence: 99%

Foundational extensible corecursion: a proof assistant perspective

Blanchette

Popescu

Traytel³

2015

SIGPLAN Not.

View full text Add to dashboard Cite

This paper presents a formalized framework for defining corecursive functions safely in a total setting, based on corecursion up-to and relational parametricity. The end product is a general corecursor that allows corecursive (and even recursive) calls under "friendly" operations, including constructors. Friendly corecursive functions can be registered as such, thereby increasing the corecursor's expressiveness. The metatheory is formalized in the Isabelle proof assistant and forms the core of a prototype tool. The corecursor is derived from first principles, without requiring new axioms or extensions of the logic.

show abstract

Fair reactive programming

Cited by 29 publications

References 31 publications

Higher-order functional reactive programming without spacetime leaks

Higher-order functional reactive programming without spacetime leaks

Synthesizing functional reactive programs

Foundational extensible corecursion: a proof assistant perspective

Contact Info

Product

Resources

About