TiarkRompf / minidotLinks
Dependent Object Types (DOT), bottom up
☆89Updated 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
- Solver for higher-order functional programs, used by Stainless☆93Updated 3 months ago
- GAPT: General Architecture for Proof Theory☆106Updated 3 weeks ago
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- System FR: Formalized Foundations for Stainless☆12Updated 3 months ago
- Introduction to algebraic effects and handlers☆98Updated 7 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- formalization of the Dependent Object Types (DOT) calculus☆161Updated 9 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆36Updated 3 months ago
- The Penn Locally Nameless Metatheory Library☆76Updated 9 months ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Updated last year
- 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
- Proof assistant based on first-order logic and set theory☆64Updated 3 weeks ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74Updated 6 years ago
- Towards changing things and see if it proofs☆60Updated 4 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- Bolts: Stainless Verified Scala Examples☆26Updated last week
- Adding extensions to DOT calculus☆24Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Haskell library implementing "Data Types a la Carte"☆92Updated 2 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 2 months ago
- ☆83Updated 10 months ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆63Updated 5 months ago
- Organization and planning for the Initial Types Club☆75Updated 3 years ago
- Work on type class deriving with elaboration reflection☆32Updated 7 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- ☆84Updated last year
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago