Displaying 1 to 14 from 14 results

crocks is a collection of popular Algebraic Data Types (ADTs) that are all the rage in functional programming. You have heard of things like Maybe and Either and heck maybe even IO, that is what these are. The main goal of crocks is to curate and provide not only a common interface between each type (where possible of course), but also provide all of the helper functions needed to hit the ground running. There are many options to use crocks to suit the needs of your, projects. When used on the backend or in an environment where size is not a big concern, the entire lib can be brought in and the various elements can be either be plucked off of or referenced by the namespace.

adt predicate-functions lift unary-functions functor composition curry monoid monad pair fp functional monadic monads fantasy applicativeAn algebra is a set of values, a set of operators that it is closed under and some laws it must obey. Each Fantasy Land algebra is a separate specification. An algebra may have dependencies on other algebras which must be implemented.

fantasy-land functional specification algebraic monad applicative functor monoid semigroup chain applyPowerful Streams and functional data types for building modern Java 8 applications. We extend JDK interfaces where possible for maximum integration.ReactiveSeq extends JDK Stream and offers multiple modes of execution - synchonous, asynchronous, asynchronous with backpressure, parallel and more.

functional-programming reactive-streams monoid streams collections data-structures monad monad-transformers reactive asynchronous java8 streams-apiThis is a specification for common algebraic structures in JavaScript based on Fantasy Land.Fantasy Land uses methods to define interfaces that a type must implement in order to support a particular Algebra. For example values of a type that implements the Monoid algebra must have fantasy-land/empty and fantasy-land/concat methods on them.

functional-programming fantasy-land specification monad functor monoid adt algebraic algebraic-data-types algebraPlus stuff that builds off of reduce like foldMap. Please contribute/complain as you want/need things.

functional immutable monoid monad applicative traversableThis course/tutorial was created with purpose to better understand functional programming idioms using Scala language. It covers type classes, monoids, functors, applicatives, monads, traversable/foldable, monad transformers, free monad. Material is structured as set of stub/unimplemented functions/classes and tests for them. Your objective is to make all unit tests green. It is learn-by-doing course. NICTA course was a great and interesting challenge for me to do in Haskell. I think Scala community will benefit from the similar course.

course functional-programming monad monoid functor typeclasses functional-idioms monad-transformers tutorial comonads monads applicativeThis development encodes category theory in Coq, with the primary aim being to allow representation and manipulation of categorical terms, as well realization of those terms in various target categories. Core Theory, covering topics such as categories, functors, natural transformations, adjunctions, kan extensions, etc.

category-theory coq monad profunctor comonads monoid profunctor-composition construction category categories functor cartesian cartesian-closed-categoryFluokitten is a Clojure library that implements category theory concepts, such as functors, applicative functors, monads, monoids etc. in idiomatic Clojure. There is a lot of documentation and tutorials at Fluokitten Website. Please make sure to check it out.

category-theory clojure-library monad monoid functorAbstractions and constructions from math (Category theory, Abstract algebra) implementations in Scala, minimal description, links to good explanations, links to implementations in other FP languages: Haskell, Idris, Purescript, non FP too: Java, C++ and to formalizations in proof assistants: Coq (UniMath, HoTT book), Cubical Agda.

category-theory monads comonads functor applicative-functors contravariant-functors free-monads free-applicative kan-extensions coyoneda yoneda arrows profunctors semigroup monoid day-convolution abstract-algebraAn implementation of Monoids in Swift. I'll add more explanation at some point, but for now, let's jump straight to a practical example: Sorting. Take a look at the data structure below. (If you're keen to test out the code, there's a Playground included with the project).

monoidAljebra provides toy implementations of the algebraic structures defined in the Fantasy Land specification, mostly borrowed from Haskell libraries. The following objects each implement a constructor allowing you to lift values into these base objects. Many of the other instances in this library are built on top of these base objects. As such, they implement a similar constructor pattern.

algebraic semigroup monoid functor applicative monadThe current version of libsemigroups is 0.6.3. libsemigroups is a C++ library for semigroups and monoids using C++11; it is partly based on Algorithms for computing finite semigroups, Expository Slides, and Semigroupe 2.01 by Jean-Eric Pin. libsemigroups uses catch for its unit tests.

computer-algebra semigroup monoid congruence enumerationNo cannot get property x of undefined. Just returns void 0 (undefined) if a value or a key does not exist. Highly inspired from Java's Optional Type.

monad monads undefined-behavior js typescript error-handling objects exception-handling monoid undefined-behaviour exception-handler object null-exception
We have large collection of open source products. Follow the tags from
Tag Cloud >>

Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
**Add Projects.**