gasche / popl2018-papersView external linksLinks
Link to preprints for POPL'18 and colocated events
☆86Jun 16, 2018Updated 7 years ago
Alternatives and similar repositories for popl2018-papers
Users that are interested in popl2018-papers are comparing it to the libraries listed below
Sorting:
- Link to preprints for POPL'17 and co-located events☆100Mar 15, 2017Updated 8 years ago
- Link to preprints for ICFP'17 and colocated events☆136Jun 19, 2018Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- Coq formalizations of functional languages.☆145Jul 2, 2020Updated 5 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- GRIN Haskell backend stripped out from JHC. (GRIN from scratch: https://github.com/grin-tech/grin)☆16Dec 13, 2018Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- "Toy" SMT Solver for Educational Purposes☆20Apr 17, 2013Updated 12 years ago
- F-omega with interval kinds mechanized in Agda☆14Aug 1, 2024Updated last year
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Oct 13, 2017Updated 8 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- Deriving via☆33Aug 6, 2018Updated 7 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆74May 10, 2019Updated 6 years ago
- Logical relations proof in Agda☆27May 27, 2015Updated 10 years ago
- An Introduction to Redex with Abstracting Abstract Machines☆104Mar 21, 2024Updated last year
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago
- ☆14Nov 23, 2016Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Scrap Your Boilerplate for MetaOCaml with modular implicits☆17Dec 21, 2015Updated 10 years ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Nov 28, 2018Updated 7 years ago
- Agda programming with holes☆28Feb 2, 2021Updated 5 years ago
- secret project☆17Mar 14, 2018Updated 7 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
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- creating a cabal new-build configuration from a stack configuration☆12May 8, 2018Updated 7 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- ☆10May 3, 2017Updated 8 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Feb 20, 2019Updated 6 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆157Jan 27, 2026Updated 2 weeks ago
- Dive into GHC☆82Dec 26, 2016Updated 9 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago