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☆89Updated 4 years ago
- formalization of the Dependent Object Types (DOT) calculus☆161Updated 9 years ago
- Solver for higher-order functional programs, used by Stainless☆93Updated 2 weeks ago
- GAPT: General Architecture for Proof Theory☆107Updated last month
- prototyping logic programming in Scala☆42Updated 3 years ago
- Isomorphic Reasoning: Counting with Types☆38Updated 5 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79Updated 3 years ago
- A Scala library which talks to Isabelle (DISCONTINUED)☆38Updated 5 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
- System FR: Formalized Foundations for Stainless☆12Updated 4 months ago
- Scala implementation of ILC, with benchmarks☆27Updated 9 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Updated 4 months ago
- eta-spark is a library that provides complete bindings for Apache Spark☆21Updated 7 years ago
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 10 years ago
- an exploration of subtyping-based category theory in scala☆25Updated 15 years ago
- Introduction to algebraic effects and handlers☆99Updated 7 years ago
- Lambda syntax for Scala EDSLs☆27Updated 2 years ago
- Talks on category-parametric programming.☆23Updated 2 years ago
- RRB-Trees: Efficient Immutable Vectors☆52Updated 13 years ago
- Experiments with sequent calculi☆28Updated 4 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Code for the "Logic, machines and sequent calculus" talk☆31Updated 3 years ago
- Here we do all categorical calculations, for small (aka, embeddable fully into a program) categories☆25Updated 7 months ago
- A well-typed symmetric-monoidal category of concurrent processes☆25Updated 7 years ago
- An Idris type provider for communicating type-checkable protocols.☆26Updated 8 years ago
- every day i'm truffling☆70Updated 4 years ago
- A recursion scheme library for Idris.☆25Updated this week
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 3 months ago
- A talk on using recursion schemes in FP.☆219Updated last year