byorgey / enumerationLinks
Simple Haskell package for efficiently indexable finite and infinite enumerations.
☆12Updated 7 months ago
Alternatives and similar repositories for enumeration
Users that are interested in enumeration are comparing it to the libraries listed below
Sorting:
- Dependently typed elimination functions using singletons☆28Updated 11 months ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Updated 3 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Invertible parsing for S-expressions☆34Updated 8 months ago
- ☆17Updated 7 years ago
- Lens interface for your filesystem☆22Updated 4 years ago
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A formal verification of Linear Temporal Logic in Coq☆23Updated 3 weeks ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- An efficient graph library for Haskell☆40Updated 3 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- ☆23Updated 8 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- An OS written in Idris (eventually...)☆20Updated 10 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 8 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- A terminal UI for inspecting steps taken by a rewriting process. Useful for the optimization phase of a compiler, or even evaluators of s…☆21Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Bring fusion to everyone☆14Updated 5 years ago