TiarkRompf / minidotLinks
Dependent Object Types (DOT), bottom up
☆89Updated 4 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
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- GAPT: General Architecture for Proof Theory☆106Updated last month
- Introduction to algebraic effects and handlers☆99Updated 7 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- System FR: Formalized Foundations for Stainless☆12Updated 4 months ago
- formalization of the Dependent Object Types (DOT) calculus☆161Updated 9 years ago
- Solver for higher-order functional programs, used by Stainless☆93Updated last week
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 4 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 2 months ago
- ☆84Updated last year
- Bolts: Stainless Verified Scala Examples☆28Updated this week
- Adding extensions to DOT calculus☆24Updated 6 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Proof assistant based on first-order logic and set theory☆63Updated last month
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- My Agda experiments☆12Updated 6 years ago
- every day i'm truffling☆70Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- ICFP 2020 papers. Crowd-sourced☆90Updated 5 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆86Updated 5 years ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 7 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