lpw25 / girards-paradox
A "implementation" of Girard's paradox in OCaml
☆105Updated 9 years ago
Alternatives and similar repositories for girards-paradox:
Users that are interested in girards-paradox are comparing it to the libraries listed below
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 3 weeks ago
- Efficient binder representation in OCaml☆40Updated 8 months ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- ☆84Updated 7 years ago
- A modular sat/smt solver with proof output.☆99Updated last year
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 8 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- OCaml with macros☆57Updated 2 months ago
- being the materials for Summer 2013's course☆112Updated last year
- ☆82Updated 10 months ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- A TACtic library for Agda☆48Updated 6 months ago
- OCaml backend for Agda☆39Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- ☆38Updated last year
- Simplified Observational Type Theory☆81Updated last year