lpw25 / girards-paradoxLinks
A "implementation" of Girard's paradox in OCaml
☆109Updated 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:
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 4 months ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 3 months ago
- A modular sat/smt solver with proof output.☆101Updated last year
- Simplified Observational Type Theory☆84Updated 2 years ago
- ☆86Updated last year
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated last month
- A pure type system implemented in OCaml☆78Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- A library for effects in Coq.☆65Updated 3 years ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 3 months ago
- A tutorial on how Agda infers things☆60Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated 10 months ago
- MetaML and MetaOCaml bibliography☆93Updated 8 months ago
- Efficient binder representation in OCaml☆43Updated last year
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆75Updated 3 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 weeks ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- Library of Unix effects for Coq.☆22Updated 5 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated 4 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- ☆37Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Unofficial git mirror of the BER MetaOCaml patchset.☆67Updated 3 months ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆101Updated 2 weeks ago