lpw25 / girards-paradox
A "implementation" of Girard's paradox in OCaml
☆108Updated 10 years ago
Alternatives and similar repositories for girards-paradox
Users that are interested in girards-paradox are comparing it to the libraries listed below
Sorting:
- A modular sat/smt solver with proof output.☆99Updated last year
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Efficient binder representation in OCaml☆42Updated 10 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- An interactive theorem prover based on lambda-tree syntax☆95Updated this week
- ☆82Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated 2 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- OCaml backend for Agda☆40Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆126Updated 11 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆59Updated 8 months ago
- Monadic effects and equational reasoning in Coq☆71Updated 3 weeks ago
- MetaML and MetaOCaml bibliography☆89Updated 5 months ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated last month
- Simplified Observational Type Theory☆81Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆94Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months ago
- A library for effects in Coq.☆65Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Strongly-typed System F in Haskell☆116Updated 2 years ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- ☆38Updated last year