samuelgruetter / dot-calculus
Formalization of the Dependent Object Types (DOT) calculus
☆62Updated 2 years ago
Related projects: ⓘ
- Dependent Object Types (DOT), bottom up☆83Updated 2 years ago
- prototyping logic programming in Scala☆40Updated 2 years ago
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 3 years ago
- Lambda syntax for Scala EDSLs☆26Updated last year
- formalization of the Dependent Object Types (DOT) calculus☆154Updated 8 years ago
- System FR: Formalized Foundations for Stainless☆9Updated 2 years ago
- Solver for higher-order functional programs, used by Stainless☆88Updated last week
- ☆81Updated 4 months ago
- Scala implementation of ILC, with benchmarks☆25Updated 8 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 2 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆31Updated 3 weeks ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 6 years ago
- an exploration of subtyping-based category theory in scala☆24Updated 13 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 8 years ago
- An implementation of the "lightweight" linear type system for System F◦ presented in "Lightweight Linear Types in System F◦" by Mazurak, …☆33Updated 9 years ago
- Isomorphic Reasoning: Counting with Types☆37Updated 4 years ago
- Adding extensions to DOT calculus☆23Updated 4 years ago
- Experiments with sequent calculi☆25Updated 3 years ago
- GAPT: General Architecture for Proof Theory☆94Updated last week
- Talks on category-parametric programming.☆22Updated 9 months ago
- A JVM bytecode assembler written in Haskell.☆36Updated 8 years ago
- Simple Dependent Type Checker☆10Updated 5 years ago
- the Scala delimited continuations plugin and library☆90Updated 4 years ago
- The Penn Locally Nameless Metatheory Library☆71Updated 2 months ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 5 months ago
- Algebraic Graphs in Scala☆26Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆77Updated 4 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆98Updated last year
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- Fast streams for Scala 3☆46Updated last year