Minimalist statemachine library for F#
-
Updated
Jan 17, 2013 - F#
Minimalist statemachine library for F#
Lazy signal synthesis based on combinators.
Exercises and solutions on *Lambda Calculus* and *Combinators* topic
A simple project to parse regexp with parser combinator
A toolkit for Plug applications to accept and respond to HTTP requests by using a decision tree built with combinators
A port of Bryan O'Sullivan's attoparsec from Haskell to F#. Nuget: 'Attoparsec'
ftor enables ML-like type-directed, functional programming with Javascript including reasonable debugging.
exploring parsing combinators in scheme
Implementing the SKI combinator calculus in Haskell's type system
Excercises from riddle book "To mock a Mockingbird"
λ Lambda Calculus Encodings
es6 port to : A small (3Kb) tree-shakeable library for generalized transformation of data (inspired by Clojure's transducers)
A combinator library for building asynchronous HTTP services
Simple Combinatory Logic and Lambda Calculus in Scala
writeups from the book of the same name
Parser Combinators for Dart. This library is heavily inspired by Parsec, a popular Haskell library
A formatting library to complement the neo4j-driver package.
How to re-implement `with` using combinators. For study purposes, not production!
Add a description, image, and links to the combinators topic page so that developers can more easily learn about it.
To associate your repository with the combinators topic, visit your repo's landing page and select "manage topics."