Applicative programming with effects
From MaRDI portal
Recommendations
- Programming with algebraic effects and handlers
- Functional programming with side-effects
- APLicative Programming with Naperian Functors
- Mixed applicative and imperative programs
- A variable typed logic of effects
- scientific article; zbMATH DE number 3940711
- scientific article; zbMATH DE number 839383
- Programming and reasoning with algebraic effects and dependent types
Cites work
Cited in
(62)- Generalising monads to arrows
- Lewis meets Brouwer: constructive strict implication
- A model of guarded recursion via generalised equilogical spaces
- The Cooper storage idiom
- A denotational semantics of textually aligned SPMD programs
- Implementing, and keeping in check, a DSL used in E-learning
- Temporal refinements for guarded recursive types
- Guarded cubical type theory
- Guarded dependent type theory with coinductive types
- Equational Reasoning with Applicative Functors
- Polynomial functors constrained by regular expressions
- The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types
- APLicative Programming with Naperian Functors
- Concrete stream calculus: an extended study
- Scala for generic programmers
- Composable discovery engines for interactive theorem proving
- A unified treatment of syntax with binders
- Probabilistic programming language and its incremental evaluation
- Relating idioms, arrows and monads from monoidal adjunctions
- A pattern for almost compositional functions
- The worker/wrapper transformation
- The Arrow Calculus as a Quantum Programming Language
- The essence of the <scp>Iterator</scp> pattern
- The Bird Tree
- Denotational semantics of recursive types in synthetic guarded domain theory
- Notions of computation as monoids
- 1ML -- core and modules united
- Causal commutative arrows
- The clocks they are adjunctions. Denotational semantics for clocked type theory
- Free applicative functors
- A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
- Extensional equality preservation and verified generic programming
- Doo bee doo bee doo
- Build systems à la carte: theory and practice
- scientific article; zbMATH DE number 7204446 (Why is no real title available?)
- Denotational semantics for guarded dependent type theory
- scientific article; zbMATH DE number 7288622 (Why is no real title available?)
- Multimodal dependent type theory
- What is a categorical model of arrows?
- Idioms are oblivious, arrows are meticulous, monads are promiscuous
- The arrow calculus
- Combinator Parsing: A Short Tutorial
- Constructive modalities with provability smack
- A representation theorem for second-order functionals
- Understanding beginners' mistakes with Haskell
- A model of guarded recursion with clock synchronisation
- A model of PCF in guarded type theory
- A correct-by-construction conversion from lambda calculus to combinatory logic
- On structuring functional programs with monoidal profunctors
- Constructing language processors with algebra combinators
- A higher-order language for Markov kernels and linear operators
- Differential 2-rigs
- On Jacobson’s “Towards a Variable-Free Semantics”
- Greatest HITs: higher inductive types in coinductive definitions via induction under clocks
- Normalization for multimodal type theory
- Structured monads for generic first-order syntax metatheory
- Syntax monads for the working formal metatheorist
- Unifying cubical and multimodal type theory
- On graded monads, distributive laws and costrong functors
- LeanLTL: a unifying framework for linear temporal logics in lean (short paper)
- Introducing \(\llparenthesis\lambda\rrparenthesis\), a \(\lambda \)-calculus for effectful computation
- A computer-verified monadic functional implementation of the integral
This page was built for publication: Applicative programming with effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437031)
