sto0pkid / swipl-ttLinks
Implementation of dependent type theory in SWI-Prolog
☆10Updated 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.☆17Updated 8 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12Updated last year
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 5 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Updated 3 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- an encoding of affine effect handlers using pthreads☆14Updated 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- ☆12Updated 6 years ago
- ☆16Updated 11 months ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- ☆17Updated 7 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated 2 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Category Theory in Agda☆13Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated last year
- A simple λProlog interpreter☆20Updated 4 years ago
- translations of a lambda abstraction to combinations of operators☆18Updated 6 years ago
- Formalization of type theory☆22Updated 4 years ago
- Experimental normalisation via scheme☆12Updated 4 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- A dependently typed type checker for a TT with intervals☆24Updated 5 years ago
- Linearizability Hoare Logic☆14Updated 10 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A categorical semantics library in Agda.☆16Updated 6 years ago