TiarkRompf / minidotLinks
Dependent Object Types (DOT), bottom up
☆87Updated 3 years ago
Alternatives and similar repositories for minidot
Users that are interested in minidot are comparing it to the libraries listed below
Sorting:
- Formalization of the Dependent Object Types (DOT) calculus☆66Updated 2 years ago
- Introduction to algebraic effects and handlers☆94Updated 7 years ago
- GAPT: General Architecture for Proof Theory☆101Updated 2 weeks ago
- Solver for higher-order functional programs, used by Stainless☆91Updated 3 months ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆33Updated 2 weeks ago
- formalization of the Dependent Object Types (DOT) calculus☆161Updated 8 years ago
- System FR: Formalized Foundations for Stainless☆10Updated 3 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 4 months ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 10 years ago
- ☆86Updated last year
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 9 months ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated 2 years ago
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- Proof assistant based on first-order logic and set theory☆57Updated this week
- My Agda experiments☆12Updated 5 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- TParsec - Total Parser Combinators in Idris☆95Updated 2 years ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 3 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Here we do all categorical calculations, for small (aka, embeddable fully into a program) categories☆25Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- Adding extensions to DOT calculus☆23Updated 5 years ago
- every day i'm truffling☆70Updated 4 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago