
TateOnProducts
 Referenced in 2 articles
[sw12475]
 twisted global sections, and also the Beilinson monads of all twists. Although the Tate resolution ... computed efficiently, starting either from a Beilinson monad or from a multigraded module...

TemplateCoq
 Referenced in 3 articles
[sw27569]
 definitions and inductives, and implement a monad for general manipulation of Coq’s logical environment...

Imperative Refinement
 Referenced in 3 articles
[sw29235]
 uses the Monadic Refinement Framework as a frontend for the specification of the abstract programs...

Certification_Monads
 Referenced in 1 article
[sw32235]
 Certification Monads. This entry provides several monads intended for the development of standalone certifiers ... specifically, there are three flavors of error monads (the sum type, for the case where ... monadic functions are total; an instance of the former, the so called check monad, yielding ... explicit bottom element) and a parser monad built on top. All of this monads...

rmonad
 Referenced in 1 article
[sw22071]
 Haskell rmonad package. A library for restricted monads based on associated datatypes. This allows datatypes ... such as Set to be made into monads. Users can either use the NoImplicitPrelude extension ... unEmbed combinators to use the normal Prelude monad operations...

Memoization
 Referenced in 1 article
[sw28640]
 into a monadified version in a state monad or the Imperative HOL heap monad ... memory implementations for the two types of monads. A number of simple techniques allow...

parsec
 Referenced in 1 article
[sw33160]
 parsec: Monadic parser combinators. Parsec is designed from scratch as an industrialstrength parser library ... fast. It is defined as a monad transformer that can be stacked on arbitrary monads...

CLF
 Referenced in 2 articles
[sw21372]
 firstclass representation of concurrent executions as monadic expressions. We illustrate the representation techniques available...

Hugs
 Referenced in 2 articles
[sw21487]
 implementation of the Haskell 98 primitives for monadic I/O, with support for simple interactive programs...

HNT
 Referenced in 2 articles
[sw22614]
 rewriting algorithms with freshness contexts; a monadic framework handling environments, freshness contexts, substitutions easily...

Celf
 Referenced in 2 articles
[sw22718]
 support representation of state and a monad to support representation of concurrency. It relies...

mtl
 Referenced in 1 article
[sw13661]
 package. Monad classes using functional dependencies, with instances for various monad transformers, inspired...

effects
 Referenced in 1 article
[sw13657]
 Pretnar. Effects can be used instead of monad transformers...

MonadPrompt
 Referenced in 1 article
[sw22070]
 Haskell MonadPrompt package. ”Prompting” monad that allows splitting the description of a computation from...

LISA
 Referenced in 1 article
[sw30492]
 datatypes (WS2S is the weak secondorder monadic logic of two successors). Our integration...

MAC
 Referenced in 1 article
[sw32897]
 wellestablished algebraic structure for computations (i.e., monads) responsible to manipulate labeled values—values coming...

sessionocaml
 Referenced in 1 article
[sw32937]
 reasonable notational overhead; and (2) a parameterised monad with a data structure called ‘slots’ manipulated...

libVATA
 Referenced in 1 article
[sw33005]
 procedures of several logics, such as the monadic secondorder logic (MSO) or the weak...

SOL
 Referenced in 1 article
[sw35247]
 literature. It includes the equational theories of monad and (lambda)calculi, Plotkin and Power...

ACL2
 Referenced in 277 articles
[sw00060]
 ACL2 is both a programming language in which...