A small implementation of graded modal dependent type theory. A younger cousin to Granule.
☆65Apr 24, 2024Updated last year
Alternatives and similar repositories for gerty
Users that are interested in gerty are comparing it to the libraries listed below
Sorting:
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆703Updated this week
- Refinement types + dependent types = ❤️☆62Aug 8, 2022Updated 3 years ago
- the Dependent Unboxed higher-oRder Intermediate Notation☆14Feb 8, 2022Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- a functional programming language with algebraic effects and handlers☆81Feb 17, 2025Updated last year
- Type-Level Programming in Rust☆27Dec 29, 2021Updated 4 years ago
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- A server for the forester tool☆17Dec 10, 2024Updated last year
- Dependent type checker using normalisation by evaluation☆274Sep 5, 2024Updated last year
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month
- 😎TT☆240Nov 20, 2025Updated 3 months ago
- Low level toy functional programming language with linear types, first class inline functions, levity polymorphism and regions.☆78Feb 19, 2026Updated last week
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13May 13, 2018Updated 7 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 3 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆390Oct 23, 2023Updated 2 years ago
- Formally verified operator language and rewriting engine for high-performance computing☆30Jun 13, 2024Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Probabilistic music composition in Idris2☆16Dec 23, 2022Updated 3 years ago
- Playing with incremental parsing and later compiler passes☆12Dec 12, 2018Updated 7 years ago
- A simple term-rewriting interpreter that displays intermediate expressions.☆14Jun 2, 2025Updated 9 months ago
- ☆21Apr 15, 2018Updated 7 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- Visualization of Haskell data structures☆16Feb 13, 2024Updated 2 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Feb 25, 2020Updated 6 years ago
- Algebraic proof discovery in Agda☆35Dec 6, 2021Updated 4 years ago
- A WIP little dependently-typed systems language☆41Aug 13, 2024Updated last year
- Formalization of type theory☆22Jul 5, 2021Updated 4 years ago
- 'Transfer' is to 'move' what 'Clone' is to 'copy'☆12Oct 13, 2019Updated 6 years ago
- Dependently-typed lambda calculus, Mini-TT, extended and implemented in Rust☆121Sep 21, 2020Updated 5 years ago
- Cur dependently-typed language in miniKanren.☆17Jan 26, 2018Updated 8 years ago
- A cost-aware logical framework, embedded in Agda.☆77Feb 23, 2026Updated last week