Expands haskell-syntax ADTs to typescript equivalent types definitions using gcanti/fp-ts-codegen
-
Updated
May 20, 2019 - TypeScript
Expands haskell-syntax ADTs to typescript equivalent types definitions using gcanti/fp-ts-codegen
Build ADT types for Typesscript from a ANTLR4 grammar
A stack (LIFO) implementation written in TypeScript.
A queue (FIFO) implementation written in TypeScript.
A mutex solution as an alternative to Promises/async+await.
A bidirectional map written in TypeScript.
A set of interfaces, abstract classes, and types that seek to describe most basic data structures.
A series of consumable elements that can be filtered, mapped, reduced, etc. into other streams, or collected into various other data structures.
An algebraic data model for strongly typed semantic data
This is a singly linked list ADT written in Typescript.
Chai assertions for ADTs from Purify
An abstraction of the list data structure.
A full-featured doubly-linked list implementation.
An ArrayList implementation in JavaScript/TypeScript.
Tree-based string storage data structure.
An easy to read and beginner friendly fp lib
SumTypes in TypeScript
Add a description, image, and links to the adt topic page so that developers can more easily learn about it.
To associate your repository with the adt topic, visit your repo's landing page and select "manage topics."