hazelgrove / agda-popl17Links
Mechanization of Hazelnut, as submitted to POPL 2017
☆16Updated 3 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:
- being the emperor of Mongo, but also a verb☆15Updated 6 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- being bits and pieces I'm inclined to leave lying around☆52Updated last week
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Deferring the Details and Deriving Programs☆14Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- NbE course @ Chalmers☆28Updated 9 months ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- System F in coq.☆19Updated 10 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- An Agda formalisation of the theory of directed containers☆12Updated 2 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week