sto0pkid / swipl-tt
Implementation of dependent type theory in SWI-Prolog
☆8Updated 4 years ago
Alternatives and similar repositories for swipl-tt:
Users that are interested in swipl-tt are comparing it to the libraries listed below
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- Category Theory in Agda☆13Updated 7 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆18Updated 4 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- ☆16Updated this week
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- 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
- translations of a lambda abstraction to combinations of operators☆18Updated 5 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A dependently typed type checker for a TT with intervals☆22Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆17Updated 6 years ago
- miniKanren with a first-order representation of the search space☆16Updated 6 months ago
- A simple supercompiler formally verified in Agda☆32Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A Gradual Dependently-typed Language☆14Updated 5 years ago
- An intensely interactive, graphical theorem prover based on natural deduction☆29Updated 10 years ago
- ☆13Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 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 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- An extended typed Lambda Calculus☆21Updated 6 months ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 10 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago