gasche / icfp2013-papersLinks
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
Sorting:
- Accepted papers for ICFP 2015☆45Updated 9 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- Accepted papers for ICFP 2014☆119Updated 9 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 7 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Template repo for theorem proving in Liquid Haskell☆32Updated 6 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago
- Accepted papers for POPL 2015☆66Updated 9 years ago
- second-order abstract syntax☆31Updated 3 years ago
- being the beginnings of at least zero typecheckers☆34Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Updated 7 years ago
- Haskell Equational Reasoning Model-to-Implementation Tunnel☆49Updated 2 years ago
- Examples of relevant technologies for implementing DSLs in Haskell.☆15Updated 9 years ago
- Type provider library for Idris☆94Updated 7 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Dump GHC's abstract syntax trees☆41Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Research middleware compiler from System F-based languages to Java with the Imperative Functional Object encoding☆45Updated 9 years ago
- Mindless, verified (erasably) coding using dependent types☆105Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22Updated 9 years ago
- ☆18Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆45Updated 2 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 5 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 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
- ☆17Updated 2 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago