bellissimogiorno / nominalView external linksLinks
Haskell implementation of nominal datatypes and functions
☆44Aug 4, 2020Updated 5 years ago
Alternatives and similar repositories for nominal
Users that are interested in nominal are comparing it to the libraries listed below
Sorting:
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 4 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 7 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A GHC source plugin which detects opportunities to use coerce☆17Aug 8, 2018Updated 7 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Mechanizations of Type Theories☆33Jan 15, 2026Updated last month
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Jan 14, 2019Updated 7 years ago
- ☆16Feb 18, 2025Updated 11 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Anders: Cubical Type Checker☆23Oct 23, 2023Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 2 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 5 months ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- haha I'm graduating☆14Jul 22, 2021Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆75Nov 7, 2025Updated 3 months ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- ☆16Mar 11, 2022Updated 3 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Mar 5, 2022Updated 3 years ago
- ☆18May 10, 2022Updated 3 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- being an operating system for typechecking processes☆131Oct 7, 2025Updated 4 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year