Fair reactive programming
From MaRDI portal
Recommendations
Cited in
(20)- When programs have to watch paint dry
- Ideal presentations and numberings of some classes of effective quasi-Polish spaces
- On the Weihrauch degree of the additive Ramsey theorem
- On the first-order parts of problems in the Weihrauch degrees
- Adjoint reactive GUI programming
- Temporal refinements for guarded recursive types
- Fair distributed computation of reactive functions
- Hilbert's tenth problem for term algebras with a substitution operator
- Defining long words succinctly in FO and MSO
- Complemented subsets and Boolean-valued, partial functions
- Algorithmically random series
- Lower bounds on () and other properties of -register machines
- Reifying dynamical algebra: maximal ideals in countable rings, constructively
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs
- Feasibility interval for the transactional event handlers of P-FRP
- On the cut-elimination of the modal -calculus: linear logic to the rescue
- Higher-order functional reactive programming without spacetime leaks
- Towards a common categorical semantics for linear-time temporal logic and functional reactive programming
- Modal FRP for all: Functional reactive programming without space leaks in Haskell
- Algebra and Coalgebra in Computer Science
This page was built for publication: Fair reactive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408431)