Dependent Object Types (DOT), bottom up
☆89Jan 9, 2022Updated 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☆66Aug 30, 2022Updated 3 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Bolts: Stainless Verified Scala Examples☆29Feb 20, 2026Updated last week
- formalization of the Dependent Object Types (DOT) calculus☆161Sep 8, 2016Updated 9 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79May 25, 2022Updated 3 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- ☆10Nov 20, 2023Updated 2 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Mar 9, 2025Updated 11 months ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Feb 20, 2026Updated last week
- Squid – type-safe metaprogramming and compilation framework for Scala☆202Feb 1, 2024Updated 2 years ago
- Extensible algebraic effects with handlers☆148Updated this week
- ☆108Jan 7, 2024Updated 2 years ago
- Miller/pattern unification in Agda☆68Oct 29, 2025Updated 4 months ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- SHAPE/S∀F∃: static prover/type-checker for N-D array programming in Scala, a use case of intuitionistic type theory☆32Sep 9, 2025Updated 5 months ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Jun 3, 2022Updated 3 years ago
- Fast streams for Scala 3☆57Feb 8, 2025Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A Scala library that provides various data structures.☆14May 6, 2019Updated 6 years ago
- 컴퓨터 신기술 특강☆10Jun 23, 2023Updated 2 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- Proof assistant based on first-order logic and set theory☆65Feb 16, 2026Updated 2 weeks ago
- Contextual types meet mechanized metatheory!☆207Sep 30, 2025Updated 5 months ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Typing the linear pi calculus in Agda☆29Mar 15, 2022Updated 3 years ago
- A core language and API for dependently typed languages☆97Feb 19, 2025Updated last year
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Command-like expressions for real infinite-precision calculations☆55Aug 5, 2025Updated 6 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Sometimes when I feel sad I implement a dependently typed lambda calculus.☆15Mar 26, 2020Updated 5 years ago
- ☆12May 9, 2015Updated 10 years ago
- A formalisation of Pure Type Systems☆10Dec 7, 2019Updated 6 years ago