sstucki / f-omega-int-agdaView external linksLinks
F-omega with interval kinds mechanized in Agda
☆14Aug 1, 2024Updated last year
Alternatives and similar repositories for f-omega-int-agda
Users that are interested in f-omega-int-agda are comparing it to the libraries listed below
Sorting:
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- ☆21Jan 24, 2022Updated 4 years ago
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Sep 10, 2024Updated last year
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A Coq to Cedille compiler written in Coq☆34Sep 22, 2020Updated 5 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year
- Adding extensions to DOT calculus☆24Jan 19, 2020Updated 6 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated 2 weeks ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Agda formalisation of second-order abstract syntax☆55Aug 28, 2022Updated 3 years ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 5, 2026Updated last week
- flexible 'let rec' generation for MetaOCaml☆28Jan 25, 2026Updated 3 weeks ago
- Simplified shell reimplementation of containers — see also https://github.com/arachsys/containers☆13Jan 25, 2023Updated 3 years ago
- System FR: Formalized Foundations for Stainless☆12Feb 2, 2026Updated 2 weeks ago
- ☆14Nov 23, 2016Updated 9 years ago
- a steady descent into madness☆17Jun 22, 2025Updated 7 months ago
- A PLT Redex implementation of Featherweight Java☆17Oct 8, 2012Updated 13 years ago
- A formalisation of Pure Type Systems☆10Dec 7, 2019Updated 6 years ago
- ☆12Oct 9, 2025Updated 4 months ago
- 3D grid and building block engine supporting the 3DML text format, similar to but predates Minecraft☆12Sep 9, 2018Updated 7 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- An interpreter for concatenative combinators (i.e. Combinators as a functional language)☆10Nov 27, 2021Updated 4 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- The Penn Locally Nameless Metatheory Library☆75Mar 26, 2025Updated 10 months ago
- Algebraic proof discovery in Agda☆35Dec 6, 2021Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Agda programming with holes☆28Feb 2, 2021Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 6 years ago
- ☆12Jul 8, 2019Updated 6 years ago