gasche / icfp2013-papers
List of ICFP'13 accepted papers, with links to preprint or additional information when available
☆72Updated 8 years ago
Alternatives and similar repositories for icfp2013-papers:
Users that are interested in icfp2013-papers are comparing it to the libraries listed below
- Accepted papers for ICFP 2014☆119Updated 8 years ago
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 6 years ago
- Effectful bindings for SQLite (forked from IdrisWeb)☆41Updated 6 years ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Free Monads and useful constructions to work with them☆26Updated 6 years ago
- Accepted papers for POPL 2015☆67Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- second-order abstract syntax☆31Updated 3 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Austin's supercompiler work☆21Updated 5 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Yet another concurrent playground☆32Updated 9 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 9 years ago
- A http client for Idris based on libcurl☆10Updated 9 years ago
- Modern compiler implementation in ML, in Haskell☆16Updated 6 years ago
- Embedding a Full Linear Lambda Calculus in Haskell☆8Updated 9 years ago
- A tiny implementation of dependent types.☆11Updated 7 years ago
- A simple XML module for Idris.☆13Updated 4 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated last week
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- ☆17Updated 2 years ago
- ☆23Updated 7 years ago
- ☆18Updated 7 years ago
- Formal proof in Coq of Banach-Tarski paradox.☆15Updated 5 months ago