bobatkey / sorting-typesLinks
Typed DSLs for sorting
☆19Updated 7 years ago
Alternatives and similar repositories for sorting-types
Users that are interested in sorting-types are comparing it to the libraries listed below
Sorting:
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- playing with hyperfunctions☆16Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 9 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Type-level assertion operators☆16Updated 7 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 10 months ago
- Experiments with effect systems☆12Updated 9 years ago
- Expands type synonyms in Template Haskell ASTs☆11Updated 9 months ago
- ☆17Updated 3 years ago
- Regular expression matching in Idris☆11Updated 9 years ago
- ☆23Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 7 years ago
- Derive editors for data types.☆28Updated 10 years ago
- A nullary type class for partial functions☆15Updated 7 years ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Updated 6 years ago
- Hakyll support for Agda literate files☆19Updated 4 years ago
- An exploration and implementation of the lambda calculus.☆12Updated 8 years ago
- A package exposing a function for generating catamorphisms.☆28Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- Various type-aligned sequence data structures.☆21Updated 4 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- System F in coq.☆19Updated 10 years ago