Reference. Adjoint Reactive GUI Programming

Most interaction with a computer is via graphical user interfaces. These are traditionally implemented imperatively, using shared mutable state and callbacks. This is efficient, but is also difficult to reason about and error prone. Functional Reactive Programming (FRP) provides an elegant alternative which allows GUIs to be designed in a declarative fashion. However, most FRP languages are synchronous and continually check for new data. This means that an FRP-style GUI will “wake up” on each program cycle. This is problematic for applications like text editors and browsers, where often nothing happens for extended periods of time, and we want the implementation to sleep until new data arrives. In this paper, we present an asynchronous FRP language for designing GUIs called 𝜆𝖶𝗂𝖽𝗀𝖾𝗍. Our language provides a novel semantics for widgets, the building block of GUIs, which offers both a natural Curry–Howard logical interpretation and an efficient implementation strategy.

Cite

Cite as @graulund-2021-adjoint (helia, typst) · \cite{graulund-2021-adjoint} (LaTeX)
BibTeX
bibtex · 1 line
@inbook{graulund-2021-adjoint, title={Adjoint Reactive GUI Programming}, ISBN={9783030719951}, ISSN={1611-3349}, url={http://dx.doi.org/10.1007/978-3-030-71995-1_15}, DOI={10.1007/978-3-030-71995-1_15}, booktitle={Foundations of Software Science and Computation Structures}, publisher={Springer International Publishing}, author={Graulund, Christian Uldal and Szamozvancev, Dmitrij and Krishnaswami, Neel}, year={2021}, pages={289–309} }
hayagriva YAML (typst)
yaml · 18 lines
graulund-2021-adjoint:
  type: chapter
  title: Adjoint Reactive GUI Programming
  author:
  - Graulund, Christian Uldal
  - Szamozvancev, Dmitrij
  - Krishnaswami, Neel
  date: 2021
  page-range: 289-309
  url: http://dx.doi.org/10.1007/978-3-030-71995-1_15
  serial-number:
    doi: 10.1007/978-3-030-71995-1_15
    isbn: '9783030719951'
    issn: 1611-3349
  parent:
    type: book
    title: Foundations of Software Science and Computation Structures
    publisher: Springer International Publishing
Cites 28 works (4 here)
With notes (4)

A judgmental reconstruction of modal logic pfenning-2001-a

DOI

A mixed linear and non-linear logic: Proofs, terms and models: Extended abstract bentonMixedLinearNonlinear1995

Intuitionistic linear logic regains the expressive power of intuitionistic logic through the ! (‘of course’) modality. Benton, Bierman, Hyland and de Paiva have given a term assignment system for ILL and an associated notion of categorical model in which the ! modality is modelled by a comonad satisfying certain extra conditions. Ordinary intuitionistic logic is then modelled in a cartesian closed category which arises as a full subcategory of the category of coalgebras for the comonad. This paper attempts to explain the connection between ILL and IL more directly and symmetrically by giving a logic, term calculus and categorical model for a system in which the linear and non-linear worlds exist on an equal footing, with operations allowing one to pass in both directions. We start from the categorical model of ILL given by Benton, Bierman, Hyland and de Paiva and show that this is equivalent to having a symmetric monoidal adjunction between a symmetric monoidal closed category and a cartesian closed category. We then derive both a sequent calculus and a natural deduction presentation of the logic corresponding to the new notion of model.
DOI

Linear logic girard_linear_1987

The familiar connective of negation is broken into two operations: linear negation which is the purely negative part of negation and the modality “of course” which has the meaning of a reaffirmation. Following this basic discovery, a completely new approach to the whole area between constructive logics and programmation is initiated.
DOI

Adjointness in Foundations lawvere_1969

DOI
External (24)
graulund-2021-adjoint reference entries/refs/graulund-2021-adjoint/graulund-2021-adjoint.hel