An abstract categorical semantics for functional reactive programming with processes

Authors:
Wolfgang Jeltsch
Affiliations:
TTÜ Küberneetika Instituut, Tallinn, Estonia
Venue:
Proceedings of the ACM SIGPLAN 2014 Workshop on Programming Languages meets Program Verification
Year:
2014

Citing 5
Cited 0

Monad as modality

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Ultrametric Semantics of Reactive Programs

LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs

PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming

Electronic Notes in Theoretical Computer Science (ENTCS)
Temporal logic with "Until", functional reactive programming with processes, and concrete process categories

PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear-time temporal logic and functional reactive programming (FRP) are related via a Curry-Howard correspondence. Thereby proofs of "always," "eventually," and "until" propositions correspond to behaviors, events, and processes, respectively. Processes in the FRP sense combine continuous and discrete aspects and generalize behaviors and events. In this paper, we develop a class of axiomatically defined categorical models of FRP with processes. We call these models abstract process categories (APCs). We relate APCs to other categorical models of FRP, namely temporal categories and concrete process categories.