ranjitjhala / sprite-langView external linksLinks
An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.
☆150Sep 23, 2025Updated 4 months ago
Alternatives and similar repositories for sprite-lang
Users that are interested in sprite-lang are comparing it to the libraries listed below
Sorting:
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago
- ☆21Sep 8, 2021Updated 4 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last week
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- Horn Clause Constraint Solving for Liquid Types☆157Jan 26, 2026Updated 2 weeks ago
- ☆16Feb 18, 2025Updated 11 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Demo for high-performance type theory elaboration☆580Feb 2, 2026Updated last week
- Refinement types + dependent types = ❤️☆62Aug 8, 2022Updated 3 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- A cost-aware logical framework, embedded in Agda.☆75Nov 7, 2025Updated 3 months ago
- A monadic library for symbolic evaluation☆73Jul 16, 2025Updated 6 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Jan 27, 2022Updated 4 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- A graphical interactive proof assistant designed for education☆171Nov 21, 2024Updated last year
- Formalization of Typed Assembly Language (TAL) in Coq☆18Mar 11, 2024Updated last year
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- [wip] Proof format and checker for first-order and higher-order theorem provers☆12Mar 29, 2023Updated 2 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆700Jan 14, 2026Updated 3 weeks ago
- MoCHi: Model Checker for Higher-Order Programs☆43Apr 19, 2025Updated 9 months ago
- Frank compiler☆304Apr 23, 2024Updated last year
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 4 months ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated last year
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Nov 27, 2023Updated 2 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- A prototype programming language for programming with runners☆92Aug 20, 2021Updated 4 years ago
- Library for Classical Coq☆40Jan 20, 2026Updated 3 weeks ago