Add to ORKGRelative monads are a generalisation of ordinary monads where the underlying functor need not be an endofunctor. In this paper, we describe a formalisation of the basic theory of relative monads in the interactive theorem prover and dependently typed programming language Agda. The formalisation comprises the requisite basic category theory, the central concepts of the theory of relative monads and adjunctions, which are compared to their ordinary counterparts, and two running examples from programming theory. 1
The goal of this article is to give an algebraic characterisation of the ab-stract syntax of functio...
Some programs are not merely sets of batch instructions performed in isolation. They interact, eithe...
Kleisli categories over monads have been used in denotational semantics to describe functional langu...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
We introduce a generalization of monads, called relative monads, allowing forunderlying functors bet...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
Monads and applicative functors are staple design patterns to handle effects in pure functional prog...
he monad is a mathematical concept, used by Haskell to describe — among other things — Input/Output....
Abstract Proof assistants based on dependent type theory are closely relatedto functional programmin...
We present a detailed examination of applications of category theory to functional programming lang...
We propose a new way to reason about general recursive functional programs in the dependently typed...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
We propose a new approach to the computer-assisted verification of functional programs. We work in...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
The goal of this article is to give an algebraic characterisation of the ab-stract syntax of functio...
Some programs are not merely sets of batch instructions performed in isolation. They interact, eithe...
Kleisli categories over monads have been used in denotational semantics to describe functional langu...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
Relative monads are a generalisation of ordinary monads where the underlying functor need not be an ...
We introduce a generalization of monads, called relative monads, allowing forunderlying functors bet...
AbstractIn this extended abstract we provide a very brief overview of the notion of a monad along wi...
Monads and applicative functors are staple design patterns to handle effects in pure functional prog...
he monad is a mathematical concept, used by Haskell to describe — among other things — Input/Output....
Abstract Proof assistants based on dependent type theory are closely relatedto functional programmin...
We present a detailed examination of applications of category theory to functional programming lang...
We propose a new way to reason about general recursive functional programs in the dependently typed...
We propose a new approach to the computer-assisted verification of functional programs. We work in f...
We propose a new approach to the computer-assisted verification of functional programs. We work in...
Relational program derivation is the technique of stepwise refining a relational specification to a ...
The goal of this article is to give an algebraic characterisation of the ab-stract syntax of functio...
Some programs are not merely sets of batch instructions performed in isolation. They interact, eithe...
Kleisli categories over monads have been used in denotational semantics to describe functional langu...