Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion

  title={Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion},
  author={W. Jeltsch},
  • W. Jeltsch
  • Published in MSFP 2014
  • Computer Science, Mathematics
Functional reactive programming (FRP) makes it possible to express temporal aspects of computations in a declarative way. Recently we developed two kinds of categorical models of FRP: abstract process categories (APCs) and concrete process categories (CPCs). Furthermore we showed that APCs generalize CPCs. In this paper, we extend APCs with additional structure. This structure models recursion and corecursion operators that are related to time. We show that the resulting categorical models… Expand
Towards the semantics of recursive procedures in categorical terms
This paper extends the categorical semantics of simple imperative language $\mathscr{J}ane$ to named blocks - procedures, which enables nested declarations, repeated calls with different arguments and recursive calls without constructing of the fixed point known from denotational approach. Expand
A Robust Framework for Asynchronous Operations on a Functional Object-Oriented Model
This paper introduces a robust framework for asynchronous operations on a functional object-oriented model for programming and is the first technique of its type. Expand
Screaming in the IO monad: a realtime audio processing and control experiment in Haskell
This paper investigates the applicability of the notion monad streams to media stream programming, and, more specifically, audio processing and control, and proposes a non-trivial transformation of audio streams at 44100 Hz with a 10 ms latency. Expand


An abstract categorical semantics for functional reactive programming with processes
This paper develops a class of axiomatically defined categorical models of FRP with processes, called abstract process categories (APCs), and relates APCs to other categorical model of FRp, namely temporal categories and concrete process categories. Expand
Towards a Common Categorical Semantics for Linear-Time Temporal Logic and Functional Reactive Programming
This work develops a common categorical semantics for a subset of LTL and its corresponding flavor of FRP and defines the more abstract concept of temporal category by extending categorical models of intuitionistic S4, and shows that fan categories are a special form of temporal categories. Expand
Ultrametric Semantics of Reactive Programs
We describe a denotational model of higher-order functional reactive programming using ultra metric spaces and non expansive maps, which provide a natural Cartesian closed generalization of causalExpand
Temporal logic with "Until", functional reactive programming with processes, and concrete process categories
This paper develops a common categorical semantics for an intuitionistic temporal logic with "until" and FRP with processes, which reflects time-dependent trueness in temporal logic, time- dependent type inhabitance in FRP, and causality of FRP operations. Expand
Fair reactive programming
This paper defines a constructive variant of LTL with least fixed point and greatest fixed point operators in the spirit of the modal mu-calculus, and gives it a proofs-as-programs interpretation as a foundational calculus for reactive programs. Expand
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs
This paper shows that Linear-time Temporal Logic (LTL) is a natural extension of the type system for FRP, which constrains the temporal behaviour of reactive programs, and shows that a constructive LTL can be defined in a dependently typed functional language, and that reactive programs form proofs of constructive L TL properties. Expand
First Steps in Synthetic Guarded Domain Theory: Step-Indexing in the Topos of Trees
It is proposed that the internal logic of S provides the right setting for the synthetic construction of abstract versions of step-indexed models of programming languages and program logics. Expand
Monad as Modality
The notion of an l-strong monad is introduced which is a generalization of strong monads which can generalize Moggi's semantics-preserving soundness and completeness with respect to his equational logic and is shown to give a sound and complete semantics of a constructive version of S4 modal logic. Expand
On an Intuitionistic Modal Logic
This paper considers an intuitionistic variant of the modal logic S4 (which it is called IS4), and places particular importance on the natural deduction formulation of IS4— this formulation has several important metatheoretic properties. Expand
Completely iterative algebras and completely iterative monads
  • S. Milius
  • Computer Science, Mathematics
  • Inf. Comput.
  • 2005
The monad given by free completely iterative algebras is proved to be the freecompletely iterative monad on the given endofunctor, which simplifies substantially all previous descriptions of these monads. Expand