TiarkRompf / minidot
Dependent Object Types (DOT), bottom up
☆83Updated 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☆63Updated 2 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 3 months ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 2 years ago
- Solver for higher-order functional programs, used by Stainless☆89Updated last week
- System FR: Formalized Foundations for Stainless☆9Updated 3 years ago
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 4 years ago
- The Penn Locally Nameless Metatheory Library☆74Updated 7 months ago
- ☆82Updated 8 months ago
- Adding extensions to DOT calculus☆23Updated 5 years ago
- Scala implementation of ILC, with benchmarks☆25Updated 8 years ago
- formalization of the Dependent Object Types (DOT) calculus☆156Updated 8 years ago
- an exploration of subtyping-based category theory in scala☆25Updated 14 years ago
- Introduction to algebraic effects and handlers☆94Updated 6 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆30Updated 2 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆78Updated 4 years ago
- GAPT: General Architecture for Proof Theory☆96Updated 2 months ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- 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
- Lambda syntax for Scala EDSLs☆26Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆54Updated 4 months ago
- Unification and type inference algorithms☆124Updated 9 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated last year
- prototyping logic programming in Scala☆41Updated 2 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- Fast streams for Scala 3☆51Updated 3 weeks ago
- ☆12Updated 9 years ago
- Experiments with sequent calculi☆26Updated 3 years ago
- My Agda experiments☆12Updated 5 years ago
- Towards changing things and see if it proofs☆59Updated 3 years ago