boyland / sasylfView external linksLinks
Educational Proof Assistant for Type Theory
☆80Jan 18, 2026Updated 3 weeks ago
Alternatives and similar repositories for sasylf
Users that are interested in sasylf are comparing it to the libraries listed below
Sorting:
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 10 months ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 3 months ago
- Haskell implementation of a version of cubical type theory developed for my master thesis☆16Nov 19, 2022Updated 3 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Formal Semantics for Why3☆19Sep 28, 2025Updated 4 months ago
- A monadic library for symbolic evaluation☆73Jul 16, 2025Updated 6 months ago
- Monadic effects and equational reasoning in Rocq☆74Dec 19, 2025Updated last month
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- A compiler for the Dana programming language☆11Apr 25, 2021Updated 4 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Mar 29, 2023Updated 2 years ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Dec 19, 2023Updated 2 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated 2 weeks ago
- Material for the Agda course at the EUTYPES Summer School '19 in Ohrid☆23Sep 3, 2019Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- The Twelf Programming Language☆150Jan 20, 2026Updated 3 weeks ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- Implementation of higher-order logic in Python☆67Feb 25, 2023Updated 2 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Jul 8, 2020Updated 5 years ago
- A tiny statically typed programming language☆18Jul 22, 2014Updated 11 years ago
- My Agda blog/lab/playground☆12Jan 31, 2026Updated last week
- ☆14Nov 4, 2025Updated 3 months ago
- new generation language☆20Aug 2, 2013Updated 12 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- ☆45Apr 8, 2025Updated 10 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- The Penn Locally Nameless Metatheory Library☆75Mar 26, 2025Updated 10 months ago
- Benchmarks for capture-avoiding substitution☆122May 30, 2025Updated 8 months ago
- ☆21Jan 8, 2021Updated 5 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A demo implementation of a simple dependently-typed language☆617Nov 18, 2024Updated last year