mpickering / icfp2015-papers
Accepted papers for ICFP 2015
☆45Updated 8 years ago
Related projects: ⓘ
- Automatically exported from code.google.com/p/trellys☆45Updated 5 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- A hip inductive theorem prover!☆87Updated 2 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆102Updated 3 months ago
- ☆18Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- A monad for interfacing with external SAT solvers☆63Updated 3 months ago
- playground for working with succinct data structures☆94Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A Specification for Dependent Types in Haskell (Core)☆65Updated 2 years ago
- The Evolution of a Typechecker☆51Updated 5 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 8 years ago
- Literature review of GHC's Core language, System FC☆67Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Mindless, verified (erasably) coding using dependent types☆104Updated 8 years ago
- Monad Transformers and Classes☆78Updated 5 years ago
- Dump GHC's abstract syntax trees☆41Updated 2 years ago
- Drafts, notes and resources for adding linear typing to GHC.☆75Updated 4 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 9 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated last year
- ☆63Updated this week
- Dive into GHC☆82Updated 7 years ago
- ☆81Updated 4 months ago
- Source material for "Functional Pearl: Getting a Quick Fix on Comonads"☆45Updated 6 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆44Updated 3 months ago