An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
☆150Sep 30, 2021Updated 4 years ago
Alternatives and similar repositories for tal
Users that are interested in tal are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Coq formalizations of functional languages.☆145Jul 2, 2020Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Hopefully verifiable code generation in GHC☆93May 10, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- ☆23Aug 30, 2017Updated 8 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆102Jun 8, 2022Updated 3 years ago
- A proof assistant for general type theories☆314Aug 9, 2025Updated 7 months ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- A re-do of the SimpleFP repo using de Bruijn index ABTs instead of HOAS☆109Jun 2, 2017Updated 8 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Type-level assertion operators☆16Mar 20, 2018Updated 8 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago