hazelgrove / agda-popl17View external linksLinks
Mechanization of Hazelnut, as submitted to POPL 2017
☆16Nov 24, 2021Updated 4 years ago
Alternatives and similar repositories for agda-popl17
Users that are interested in agda-popl17 are comparing it to the libraries listed below
Sorting:
- Dealing with Flags and Options☆13Sep 10, 2021Updated 4 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Feb 2, 2019Updated 7 years ago
- Merge sort correctness proof☆11May 21, 2015Updated 10 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Simple reference implementation of Hazelnut using js_of_ocaml and OCaml React. (frozen -- ongoing development in the hazel repo)☆30Sep 4, 2017Updated 8 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- An exploration and implementation of the lambda calculus.☆12Oct 18, 2016Updated 9 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- wherein I implement several substructural logics in Agda☆24Oct 8, 2018Updated 7 years ago
- An Agda formalisation of the theory of directed containers☆12Apr 25, 2025Updated 9 months ago
- ☆12Jul 8, 2019Updated 6 years ago
- ☆10May 3, 2017Updated 8 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- being bits and pieces I'm inclined to leave lying around☆56Jan 22, 2026Updated 3 weeks ago
- A TACtic library for Agda☆51Sep 14, 2024Updated last year
- Invertible syntax for Scala.☆13Oct 17, 2016Updated 9 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Agda programming with holes☆28Feb 2, 2021Updated 5 years ago
- LaTeX style file to typeset functional languages like Haskell☆26Mar 25, 2013Updated 12 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Apr 29, 2021Updated 4 years ago
- OCaml backend for Agda☆39Oct 4, 2018Updated 7 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago