0xd34df00d / refinedtView external linksLinks
Refinement types + dependent types = ❤️
☆62Aug 8, 2022Updated 3 years ago
Alternatives and similar repositories for refinedt
Users that are interested in refinedt are comparing it to the libraries listed below
Sorting:
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Apr 7, 2024Updated last year
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 2 months ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Feb 8, 2022Updated 4 years ago
- Linearizability Hoare Logic☆17Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆65Apr 24, 2024Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- ☆15Oct 31, 2023Updated 2 years ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 2 months ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- Organize mathematical thoughts☆21Oct 6, 2023Updated 2 years ago
- A work-in-progress structure editor for the cooltt proof assistant.☆18Jul 28, 2022Updated 3 years ago
- Mechanizations of Type Theories☆33Jan 15, 2026Updated 3 weeks ago
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆53Jan 23, 2023Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- 📚 A library for managing libraries and resolving unit paths☆17Nov 21, 2025Updated 2 months ago
- ☆16Mar 11, 2022Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- my phd thesis☆26Aug 7, 2024Updated last year
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Sep 23, 2025Updated 4 months ago
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 years ago
- Demo for high-performance type theory elaboration☆580Feb 2, 2026Updated last week
- higher order dependently typed logic programing☆173Aug 7, 2018Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- HoTT Book formalisations in Rzk.☆20Dec 15, 2023Updated 2 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 4 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- 😎TT☆241Nov 20, 2025Updated 2 months ago