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.☆115Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆67Updated 7 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆63Updated last year
- The Evolution of a Typechecker☆54Updated 6 years ago
- A library for effects in Coq.☆65Updated 3 years ago
- ☆84Updated last year
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆46Updated 3 months ago
- A modular sat/smt solver with proof output.☆101Updated last year
- A tutorial on how Agda infers things☆63Updated 3 months ago
- A Coq library for parametric coinduction☆50Updated 9 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Simplified Observational Type Theory☆85Updated 2 years ago
- The Penn Locally Nameless Metatheory Library☆76Updated 7 months ago
- A survey of semantics styles in Coq, from natural semantics through structural operational, axiomatic, and denotational semantics, to abs…☆54Updated 3 months ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆44Updated 2 weeks ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆85Updated 5 years ago
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆68Updated last year
- Benchmarks for capture-avoiding substitution☆120Updated 5 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆73Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 7 months ago
- Efficient binder representation in OCaml☆43Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- MetaML and MetaOCaml bibliography☆94Updated 10 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Library of Unix effects for Coq.☆23Updated 6 years ago