mpickering / icfp2015-papers
Accepted papers for ICFP 2015
☆45Updated 9 years ago
Alternatives and similar repositories for icfp2015-papers:
Users that are interested in icfp2015-papers are comparing it to the libraries listed below
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- ☆18Updated 7 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆104Updated 2 weeks ago
- playground for working with succinct data structures☆97Updated 9 years ago
- List of ICFP'13 accepted papers, with links to preprint or additional information when available☆72Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Link to preprints for ICFP'17 and colocated events☆136Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Link to preprints for POPL'17 and co-located events☆100Updated 8 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Hopefully verifiable code generation in GHC☆94Updated 7 years ago
- Literature review of GHC's Core language, System FC☆66Updated 6 years ago
- Clojure-style transients for Haskell☆32Updated 2 years ago
- Link to preprints for ICFP'16 and co-located events☆139Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Compositional type checking for Haskell☆37Updated 13 years ago
- Dive into GHC☆82Updated 8 years ago
- Monad Transformers and Classes☆77Updated 5 years ago
- Type provider library for Idris☆94Updated 7 years ago
- Dump GHC's abstract syntax trees☆41Updated 2 years ago
- haskell lazy evaluation illustrated☆72Updated 7 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year