Corpus ID: 198232540

A Real-World Application with a Comonadic User Interface

@inproceedings{Xavier2018ARA,
  title={A Real-World Application with a Comonadic User Interface},
  author={Arthur Xavier},
  year={2018}
}
The category-theoretical notion of a comonad is used by Freeman [2016b] to develop a pure functional model that summarizes and abstracts many different user interface paradigms (or architectures) and their behaviour in applications, whereby each different user interface (UI) paradigm corresponds to a different choice of comonad. This work presents a real-world application developed using an extended model based on the original by Freeman. These extensions to the original model should address… Expand

Figures from this paper

References

SHOWING 1-10 OF 22 REFERENCES
The Essence of Dataflow Programming
TLDR
A generic comonadic interpreter of languages for context-dependent computation and instantiate it for stream-based computation and discusses distributive laws of a comonad over a monad as a means to structure combinations of effectful and context- dependent computation. Expand
A Notation for Comonads
TLDR
It is argued that comonads, the dual of monads, similarly provide a useful design pattern, capturing notions of context dependence. Expand
Elm : Concurrent FRP for Functional GUIs
TLDR
Elm is presented, a concurrent FRP language focused on easily creating responsive GUIs and its two major features simplify the complicated task of creating responsive and usable graphical user interfaces. Expand
Why are Human-Computer interfaces Difficult to Design and Implement?
Everyone knows that designing and implementing human-computer interfaces is difficult and time-consuming. However, there is little discussion of why this is true. Should we expect that a new methodExpand
Comonadic Notions of Computation
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on streams) and of treeExpand
Codata and Comonads in Haskell
TLDR
The second topic of the paper is comonads in Haskell, where Haskell can provide rst-class codata types, and Simon Peyton Jones has suggested that with the ability to hide a representation type, Haskell's modules permit the declaration of abstract objects (without an inheritance mechanism). Expand
Monad transformers and modular interpreters
TLDR
A fully modular interpreter based on monad transformers that incudes features missing from Steele's, Espinosa's, and Wadler's earlier efforts is designed and implemented in Gofer, whose constructor classes provide just the added power over Haskell's type classes to allow precise and convenient expression of the ideas. Expand
On closed categories of functors
Brian Day Received November 7, 19~9 The purpose of the present paper is to develop in further detail the remarks, concerning the relationship of Kan functor extensions to closed structures on functorExpand
Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews
TLDR
It is found that RSS workload resembles the Web in content size and popularity; feeds are typically small (less than 10KB), albeit with a heavy tail, and feed popularity follows a power law distribution. Expand
What is RSS and how can it serve libraries
TLDR
Examines RDF Site Summary, or Rich Site Summary (RSS) feeds, a means of distributing news or other Web content from an online publisher to users, and offers suggestions on potential library uses of RSS. Expand
...
1
2
3
...