mpickering / icfp2015-papers
Accepted papers for ICFP 2015
☆45Updated 8 years ago
Alternatives and similar repositories for icfp2015-papers:
Users that are interested in icfp2015-papers are comparing it to the libraries listed below
- A hip inductive theorem prover!☆89Updated 3 years ago
- playground for working with succinct data structures☆95Updated 9 years ago
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- Dive into GHC☆82Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 9 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Link to preprints for ICFP'17 and colocated events☆136Updated 6 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- A monad for interfacing with external SAT solvers☆64Updated 3 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- ☆18Updated 7 years ago
- Link to preprints for ICFP'16 and co-located events☆139Updated 8 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆104Updated 2 months ago
- Clojure-style transients for Haskell☆32Updated 2 years ago
- Type provider library for Idris☆94Updated 7 years ago
- Monad Transformers and Classes☆77Updated 5 years ago
- Dump GHC's abstract syntax trees☆41Updated 2 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- YUP is a proof checker that performs automatic checking of simple program-correctness proofs of functional programs through inductive and…☆36Updated 2 years ago
- being the beginnings of at least zero typecheckers☆32Updated 7 years ago
- ☆84Updated 7 years ago
- Source material for "Functional Pearl: Getting a Quick Fix on Comonads"☆46Updated 6 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- Accepted papers for POPL 2015☆67Updated 8 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago