TiarkRompf / minidot
Dependent Object Types (DOT), bottom up
☆83Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for minidot
- Formalization of the Dependent Object Types (DOT) calculus☆62Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 weeks ago
- The Penn Locally Nameless Metatheory Library☆71Updated 4 months ago
- Introduction to algebraic effects and handlers☆93Updated 6 years ago
- GAPT: General Architecture for Proof Theory☆94Updated last week
- Solver for higher-order functional programs, used by Stainless☆88Updated 2 weeks ago
- ☆80Updated 6 months ago
- formalization of the Dependent Object Types (DOT) calculus☆154Updated 8 years ago
- System FR: Formalized Foundations for Stainless☆9Updated 3 years ago
- Adding extensions to DOT calculus☆23Updated 4 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated 2 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- An enhanced unification algorithm for Coq☆49Updated 5 months ago
- A Coq library for parametric coinduction☆43Updated last month
- SPLV20 course notes☆106Updated 2 years ago
- The Evolution of a Typechecker☆54Updated 5 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- Organization and planning for the Initial Types Club☆71Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆90Updated this week
- ☆12Updated 9 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago