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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Formalization of the Dependent Object Types (DOT) calculus☆66Aug 30, 2022Updated 3 years ago
- formalization of the Dependent Object Types (DOT) calculus☆161Sep 8, 2016Updated 9 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- A Coq-based synthesis of Scala programs which are correct-by-construction☆79May 25, 2022Updated 3 years ago
- ☆11Oct 7, 2025Updated 5 months ago
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- A formalisation of Pure Type Systems☆10Dec 7, 2019Updated 6 years ago
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆47Mar 9, 2025Updated last year
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- ☆10Nov 20, 2023Updated 2 years ago
- ☆12May 9, 2015Updated 10 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Feb 20, 2026Updated last month
- Extensible algebraic effects with handlers☆148Mar 2, 2026Updated 3 weeks ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Squid – type-safe metaprogramming and compilation framework for Scala☆203Feb 1, 2024Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- ☆108Jan 7, 2024Updated 2 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 6 months ago
- Miller/pattern unification in Agda☆69Oct 29, 2025Updated 4 months ago
- A Scala library that provides various data structures.☆14May 6, 2019Updated 6 years ago
- Coq formalizations of functional languages.☆145Jul 2, 2020Updated 5 years ago
- 컴퓨터 신기술 특강☆10Jun 23, 2023Updated 2 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Apr 18, 2018Updated 7 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆33Oct 22, 2024Updated last year
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Mar 2, 2026Updated 3 weeks ago
- Fast streams for Scala 3☆57Feb 8, 2025Updated last year
- Experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for LambdaJS and a subset of Scheme pro…☆30Nov 24, 2015Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A core language and API for dependently typed languages☆97Feb 19, 2025Updated last year