Higher-order functional reactive programming in bounded space

DOI10.1145/2103656.2103665zbMath1321.68171OpenAlexW4236134058MaRDI QIDQ2942856

Nick Benton, Jan Hoffmann, Neelakantan R. Krishnaswami

Publication date: 11 September 2015

Published in: Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2103656.2103665

zbMATH Keywords

linear logicfunctional reactive programmingdataflowspace-bounded computationbunched implications

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items (5)

Abstract categorical semantics for resourceful functional reactive programming ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Modal FRP for all: Functional reactive programming without space leaks in Haskell ⋮ The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types ⋮ A Light Modality for Recursion

This page was built for publication: Higher-order functional reactive programming in bounded space