TiarkRompf / minidot
Dependent Object Types (DOT), bottom up
☆84Updated 3 years ago
Alternatives and similar repositories for minidot:
Users that are interested in minidot are comparing it to the libraries listed below
- Formalization of the Dependent Object Types (DOT) calculus☆64Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 4 months ago
- The Penn Locally Nameless Metatheory Library☆74Updated 8 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆79Updated 4 years ago
- Solver for higher-order functional programs, used by Stainless☆89Updated 3 weeks ago
- Adding extensions to DOT calculus☆23Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 5 months ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 2 years ago
- ☆82Updated 9 months ago
- formalization of the Dependent Object Types (DOT) calculus☆156Updated 8 years ago
- Old Coq plugin for parametricity [maintainer=@ppedrot]☆45Updated this week
- Total Parser Combinators in Coq [maintainer=@womeier]☆43Updated last year
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 9 years ago
- Unification and type inference algorithms☆124Updated 10 years ago
- System FR: Formalized Foundations for Stainless☆9Updated 3 years ago
- An enhanced unification algorithm for Coq☆53Updated this week
- GAPT: General Architecture for Proof Theory☆97Updated this week
- Introduction to algebraic effects and handlers☆95Updated 6 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆31Updated last week
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Scala implementation of ILC, with benchmarks☆25Updated 8 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Isomorphic Reasoning: Counting with Types☆37Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 4 months ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- prototyping logic programming in Scala☆41Updated 2 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago