TiarkRompf / minidotLinks
Dependent Object Types (DOT), bottom up
☆88Updated 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 3 years ago
- GAPT: General Architecture for Proof Theory☆103Updated last week
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- Solver for higher-order functional programs, used by Stainless☆92Updated this week
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- System FR: Formalized Foundations for Stainless☆10Updated 3 years ago
- formalization of the Dependent Object Types (DOT) calculus☆161Updated 9 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆35Updated last month
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated 10 months ago
- Experiments with sequent calculi☆27Updated 4 years 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
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 2 years ago
- Bolts: Stainless Verified Scala Examples☆26Updated this week
- ICFP 2020 papers. Crowd-sourced☆91Updated 5 years ago
- ☆86Updated last year
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆72Updated 6 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆84Updated 5 years ago
- Proof assistant based on first-order logic and set theory☆62Updated last week
- Adding extensions to DOT calculus☆24Updated 5 years ago
- every day i'm truffling☆70Updated 4 years ago
- ☆83Updated 6 months ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- My Agda experiments☆12Updated 5 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 7 years ago