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 bits and pieces I'm inclined to leave lying around☆50Updated 6 months ago
- NbE course @ Chalmers☆28Updated 8 months ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- being the materials from my YOW LambdaJam 2016 talk☆10Updated 9 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Updated 6 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- being a programming language for sequential circuits☆20Updated 7 months ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- Compiling to STLC to categories in Haskell and Coq, using Conal Elliot's work☆19Updated 7 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Interpreter for functional pure type systems.☆21Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- ☆16Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Work on type class deriving with elaboration reflection☆32Updated 6 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 9 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago