higher order dependently typed logic programing
☆173Aug 7, 2018Updated 7 years ago
Alternatives and similar repositories for caledon
Users that are interested in caledon are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆216Mar 25, 2022Updated 3 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Dependent type checker using normalisation by evaluation☆275Sep 5, 2024Updated last year
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- silly-k is an experimental language inspired by K and APL☆16Oct 27, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- A complete, production-quality Java parser for the SQL language.☆10Aug 25, 2014Updated 11 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Calculus of Constructions☆18Jul 17, 2019Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆68Sep 17, 2024Updated last year
- A demo implementation of a simple dependently-typed language☆620Nov 18, 2024Updated last year
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Observational Type Theory as an Agda library☆59May 27, 2017Updated 8 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- ScopeT and ScopeH☆13Aug 3, 2024Updated last year
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- Horn Clause Constraint Solving for Liquid Types☆160Updated this week
- A collection of code related to the HANSEI language☆10Jun 14, 2016Updated 9 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- A simple way to query constructors, like cases but slightly more concise☆11Mar 7, 2018Updated 8 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last month
- RDF Graph Database (http://grid.hust.edu.cn/triplebit/)☆11Sep 19, 2014Updated 11 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆392Oct 23, 2023Updated 2 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated 2 months ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Refinement types + dependent types = ❤️☆62Aug 8, 2022Updated 3 years ago