Practical type inference for arbitrary-rank types
☆11May 25, 2019Updated 6 years ago
Alternatives and similar repositories for higher-rank
Users that are interested in higher-rank are comparing it to the libraries listed below
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- The Delphin Project☆10Aug 19, 2016Updated 9 years ago
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Feb 8, 2022Updated 4 years ago
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- ☆21Apr 15, 2018Updated 7 years ago
- OCaml implementation of DSub, a ML like language with subtyping and path dependent types.☆13Apr 18, 2017Updated 8 years ago
- ☆14Nov 4, 2025Updated 4 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Aug 28, 2020Updated 5 years ago
- Source files used for the Cedille Cast videos☆13Dec 28, 2025Updated 2 months ago
- JNumberTools is an open-source Java library for solving complex problems in combinatorics and number theory. Whether you're a researcher,…☆13Updated this week
- Zippers for cofree types☆14Dec 7, 2021Updated 4 years ago
- Implementation of "practical type inference for arbitrary-rank types" in Javascript☆12Mar 27, 2019Updated 6 years ago
- A tutorial on how Agda infers things☆64Jul 10, 2025Updated 7 months ago
- ☆17Oct 16, 2018Updated 7 years ago
- Implementing a small functional language with a combinator based graph-reduction machine☆40Sep 10, 2025Updated 5 months ago
- Matita (proof assistant) with embedded elpi☆15Jan 30, 2018Updated 8 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- Utilities for working with partial functions☆15Dec 27, 2025Updated 2 months ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Apr 15, 2021Updated 4 years ago
- A style guide for Coq☆18Nov 30, 2021Updated 4 years ago
- A TOML parser for Idris 2☆17Jun 27, 2024Updated last year
- Haskell implementation and Coq proof for an implicit polymorphic gradual type system.☆17May 27, 2020Updated 5 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…☆24Updated this week
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- A toy dependent typed language.☆46Updated this week
- Setoid type theory implementation☆40Aug 24, 2023Updated 2 years ago
- An encoding of linear logic in Coq with minimal Sokoban and blocks world examples☆22Feb 4, 2022Updated 4 years ago
- SLAYER ported to Racket☆21Jun 15, 2019Updated 6 years ago
- pattern combinators extending racket/match to capture 🔗 contexts 📦☆20Jul 8, 2019Updated 6 years ago
- Static security for database-backed Haskell applications using Liquid Haskell☆18May 29, 2024Updated last year
- Playing with type systems☆51Dec 29, 2024Updated last year
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Jun 1, 2016Updated 9 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Oct 15, 2025Updated 4 months ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆118Apr 6, 2019Updated 6 years ago
- A Teeny Type Theory☆27Jun 4, 2022Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago