PseudoPower / AFSMLinks
Arrowized functional state machines
☆18Updated 9 years ago
Alternatives and similar repositories for AFSM
Users that are interested in AFSM are comparing it to the libraries listed below
Sorting:
- Miscellaneous constructions on monoids☆24Updated last week
- Infer user interfaces from type signatures☆77Updated 8 years ago
- Compile PureScript into Haskell.☆68Updated 8 years ago
- a simple functional language for learners☆30Updated 9 years ago
- Haskell types lined up to highlight their similarities☆30Updated 6 years ago
- Haskell library for simple, concise and fast generic operations.☆82Updated 2 years ago
- A Prelude with names from category theory☆51Updated 9 years ago
- Template for Hindley-Milner based languages☆39Updated 4 years ago
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- A Haskell library providing separation of effects on the type level, effectively splitting up the monolithic IO-monad into more limited c…☆27Updated 7 years ago
- an applicative functor that seamlessly talks to HTML inputs☆72Updated 6 years ago
- An approach to user interfaces based in denotational design.☆27Updated 3 years ago
- Free applicative functors for PureScript☆26Updated 3 years ago
- Supporting code for the book /Lenses for the Mere Mortal: PureScript Edition/☆33Updated 3 years ago
- ☆21Updated 2 years ago
- A typed, persistent store for values of arbitrary types☆62Updated last month
- An "extensible coeffect" system built out of comonads and Day convolution.☆36Updated 5 years ago
- Measure time complexity empirically.☆49Updated 10 years ago
- A Purescript library for parsing SlamData's dialect of Markdown.☆38Updated 6 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- Generate TypeScript definition files from your ADTs☆65Updated 6 months ago
- Quick scaffolding for Halogen's HTML DSL☆35Updated 4 years ago
- Generic programming using an approach inspired by GHC.Generics☆41Updated 4 years ago
- Types and kinds for basic type-level programming☆64Updated last year
- Declare and access tuple fields with labels☆59Updated 7 years ago
- Generalized folds, unfolds, and traversals for fixed point data structures☆58Updated 3 years ago
- Free monads, Cofree comonads, Yoneda and Coyoneda functors, and the Trampoline monad.☆96Updated 2 years ago
- A library for applying a row of rules for validation to refine a value☆12Updated 7 years ago
- Incremental lambda calculus☆80Updated 6 years ago
- ☆46Updated 9 years ago