yoricksijsling / ornaments-thesisView external linksLinks
My master thesis about generic programming and ornaments
☆16Jul 5, 2016Updated 9 years ago
Alternatives and similar repositories for ornaments-thesis
Users that are interested in ornaments-thesis are comparing it to the libraries listed below
Sorting:
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- A library for doing generic programming in Agda☆36Jan 27, 2021Updated 5 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- ☆20Aug 13, 2024Updated last year
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 2 months ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago
- https://metaborg.github.io/mj.agda/☆13Oct 14, 2020Updated 5 years ago
- An higher-level LLVM binding for OCaml☆14Apr 4, 2017Updated 8 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- LaTeX style file to typeset functional languages like Haskell☆26Mar 25, 2013Updated 12 years ago
- being a thing I build on a Saturday☆28Mar 5, 2018Updated 7 years ago
- ☆21Jan 24, 2022Updated 4 years ago
- Deriving via☆33Aug 6, 2018Updated 7 years ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 3 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- Code for the submitted TyDe '16 extended abstract and C∘mp∘se '17 talk "`choose` Your Own Derivative"☆19May 18, 2017Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Mechanization of Hazelnut, as submitted to POPL 2017☆16Nov 24, 2021Updated 4 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Jun 16, 2024Updated last year
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 2 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago