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
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- ☆38Updated last year
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 9 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated 3 months ago
- The Penn Locally Nameless Metatheory Library☆74Updated 7 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 7 months ago
- OCaml backend for Agda☆39Updated 6 years ago
- Efficient binder representation in OCaml☆39Updated 6 months ago
- A tutorial on how Agda infers things☆39Updated 4 years ago
- Total Parser Combinators in Agda☆125Updated last year
- ☆84Updated 7 years ago
- A TACtic library for Agda☆48Updated 4 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 5 months ago
- Tiny type-checker with dependent types☆76Updated 11 years ago
- A library for effects in Coq.☆64Updated 2 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆91Updated 2 weeks ago
- ☆82Updated 8 months ago