samuelgruetter / dot-calculusLinks
Formalization of the Dependent Object Types (DOT) calculus
☆66Updated 3 years ago
Alternatives and similar repositories for dot-calculus
Users that are interested in dot-calculus are comparing it to the libraries listed below
Sorting:
- Dependent Object Types (DOT), bottom up☆88Updated 3 years ago
- GAPT: General Architecture for Proof Theory☆102Updated this week
- Solver for higher-order functional programs, used by Stainless☆92Updated last week
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆33Updated last month
- formalization of the Dependent Object Types (DOT) calculus☆161Updated 9 years ago
- Introduction to algebraic effects and handlers☆96Updated 7 years ago
- prototyping logic programming in Scala☆41Updated 3 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- Scala implementation of ILC, with benchmarks☆28Updated 9 years ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 7 years ago
- Experiments with sequent calculi☆27Updated 4 years ago
- System FR: Formalized Foundations for Stainless☆10Updated 3 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- Bolts: Stainless Verified Scala Examples☆26Updated this week
- HoTT Note-taking action☆25Updated 6 years ago
- every day i'm truffling☆70Updated 4 years ago
- Luck -- A Language for Property-Based Generators☆35Updated 6 months ago
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 4 years ago
- The Penn Locally Nameless Metatheory Library☆75Updated 5 months ago
- ☆86Updated 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
- Lambda syntax for Scala EDSLs☆27Updated last year
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- A Haskell parser for JVM bytecode files☆39Updated last year
- an exploration of subtyping-based category theory in scala☆25Updated 14 years ago
- Proof assistant based on first-order logic and set theory☆62Updated last week
- Purely functional data structures in Idris☆10Updated 7 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated 2 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆19Updated this week