yallop / higherLinks
Higher-kinded programming in OCaml
☆183Updated last year
Alternatives and similar repositories for higher
Users that are interested in higher are comparing it to the libraries listed below
Sorting:
- OCaml extended with modular implicits☆104Updated 6 years ago
- System Fω interpreter for use in Advanced Functional Programming course☆65Updated last year
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Functional programming library for OCaml☆60Updated 5 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Inline (Unit) Tests for OCaml☆67Updated 4 years ago
- Staged metaprogramming in stock OCaml☆152Updated last year
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101Updated 8 years ago
- Tools for authors of ppx rewriters☆134Updated last year
- Experimental Malfunction backend for Idris☆82Updated 7 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- A simple monadic parser combinator library for OCaml☆67Updated 2 years ago
- Generate nix expressions from opam packages☆93Updated 4 months ago
- A language experiment -- irc.freenode.net ##coda☆162Updated last year
- Private extraction of astrada's lens library☆57Updated 4 years ago
- The Disco Discus Compiler☆174Updated 6 years ago
- Simple template for midsize OCaml project☆125Updated 5 months ago
- Link to preprints for ICFP'17 and colocated events☆136Updated 7 years ago
- ☆83Updated last year
- Cabal like system for OCaml☆130Updated 4 years ago
- OCaml Programming Patterns - random tricks, "design patterns", etc.☆52Updated 5 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- Simplified Observational Type Theory☆83Updated 2 years ago
- Type provider library for Idris☆94Updated 7 years ago
- Example row-polymorphism implementations☆61Updated last year
- TParsec - Total Parser Combinators in Idris☆95Updated last year
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated this week
- Recursion schemes for Idris☆65Updated 6 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago