Alternatives and similar repositories for icfp2013-papers

Users that are interested in icfp2013-papers are comparing it to the libraries listed below

• mpickering / icfp2015-papers
  Accepted papers for ICFP 2015
  ☆45Updated 9 years ago
• yallop / icfp2014-papers
  Accepted papers for ICFP 2014
  ☆119Updated 9 years ago
• iu-parfunc / haskell_dsl_tour
  Examples of relevant technologies for implementing DSLs in Haskell.
  ☆15Updated 9 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆87Updated 6 years ago
• cmcl / franklyfrank
  A prototype implementation of the Frank programming language
  ☆17Updated 9 years ago
• yallop / popl2015-papers
  Accepted papers for POPL 2015
  ☆66Updated 9 years ago
• robrix / abstract-interpretation
  Experiments in abstracting definitional interpreters
  ☆16Updated 7 years ago
• nikivazou / theorem-proving-template
  Template repo for theorem proving in Liquid Haskell
  ☆32Updated 6 years ago
• UCSD-PL / nano-smt
  "Toy" SMT Solver for Educational Purposes
  ☆20Updated 12 years ago
• ekmett / concurrent
  Yet another concurrent playground
  ☆33Updated 9 years ago
• kellino / microML
  a simple functional language for learners
  ☆30Updated 8 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• ekmett / structs
  Exploring how to make a strict imperative universe in the GHC runtime system.
  ☆48Updated 5 months ago
• jyp / prettiest
  The Prettiest Printer
  ☆34Updated last year
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• LeventErkok / sbvPlugin
  Formally prove properties of Haskell programs using SBV/SMT.
  ☆45Updated 2 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• tranma / empirical-big-oh
  Measure time complexity empirically.
  ☆48Updated 9 years ago
• idris-hackers / idris-free
  Free Monads and useful constructions to work with them
  ☆26Updated 6 years ago
• jwiegley / linearscan
  ☆17Updated 2 years ago
• idris-hackers / idris-posix
  System POSIX bindings for Idris.
  ☆36Updated 6 years ago
• lastland / WebSpec
  ☆18Updated 8 years ago
• danr / hipspec
  A hip inductive theorem prover!
  ☆89Updated 3 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆25Updated 7 years ago
• mietek / et-lang
  ET (IPL) language interpreters and literature
  ☆26Updated 6 years ago
• ekmett / transients
  Clojure-style transients for Haskell
  ☆32Updated 2 years ago
• pigworker / shonky
  being some experiments, working towards some equipment I wish I had
  ☆37Updated 9 years ago
• roglo / banach_tarski
  Formal proof in Coq of Banach-Tarski paradox.
  ☆16Updated last month
• chadaustin / buffer-builder
  Haskell library for efficiently building up buffers
  ☆26Updated 4 months ago