sto0pkid / swipl-ttView external linksLinks
Implementation of dependent type theory in SWI-Prolog
☆10Oct 6, 2020Updated 5 years ago
Alternatives and similar repositories for swipl-tt
Users that are interested in swipl-tt are comparing it to the libraries listed below
Sorting:
- Cur dependently-typed language in miniKanren.☆17Jan 26, 2018Updated 8 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last week
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆21Jul 19, 2016Updated 9 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- a self-hosting lambda calculus compiler☆37Mar 31, 2025Updated 10 months ago
- Code for tutorials, papers and experiments. Mostly Agda, Coq and Haskell.☆21Feb 17, 2023Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- A simple supercompiler formally verified in Agda☆34Mar 17, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- ☆23Aug 30, 2017Updated 8 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Jan 18, 2020Updated 6 years ago
- Complexity analysis in Lean☆10Feb 5, 2024Updated 2 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A server for the forester tool☆17Dec 10, 2024Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years 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
- MixML prototype interpreter☆27Dec 13, 2019Updated 6 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Jan 15, 2026Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- ☆12May 9, 2015Updated 10 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 4 months ago
- Chatbot impls in Prolog☆15Feb 15, 2022Updated 4 years ago
- Experiments with linear types☆14Feb 23, 2018Updated 7 years ago
- Faceted execution in Racket☆11Sep 11, 2018Updated 7 years ago
- crowd-defunding☆10Feb 3, 2026Updated 2 weeks ago
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆23Mar 30, 2011Updated 14 years ago
- Cellular automata environment written in Common Lisp☆17Apr 17, 2021Updated 4 years ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- The Delphin Project☆10Aug 19, 2016Updated 9 years ago
- Various mechanized proof files for fun.☆13Aug 11, 2025Updated 6 months ago