2018Electronic Notes in Theoretical Computer ScienceOpen access

Near Distributive Laws

Ernie Manes, P. S. Mulry

Open full text 0 citations

Abstract

Monads and their compositions can sometimes be generated from simpler data types and without necessarily requiring any monad axioms. Free monads and monad approximations provide two approaches to overcoming the constraints required by monad composition laws while generating near distributive laws.

Open-access reader

About this research paper

What this paper is about

Monads and their compositions can sometimes be generated from simpler data types and without necessarily requiring any monad axioms. Free monads and monad approximations provide two approaches to overcoming the constraints required by monad composition laws while generating near distributive laws.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Monads and their compositions can sometimes be generated from simpler data types and without necessarily requiring any monad axioms. Free monads and monad approximations provide two approaches to overcoming the constraints required by monad composition laws while generating near distributive laws.

Key concepts: Monad (category theory), Distributive property, Axiom, Law, Computer science, Mathematics, Pure mathematics, Functor

Related papers

Back to paper searchBrowse research topicsOriginal source
Near Distributive Laws — Research Paper | ScholarLens