A year ago I published Agda code for “Why dependent types matter” paper by Thorsten Altenkirch, Conor McBride and James McKinna. Now I rewrote that code in Haskell. This work is similar to my recent conversion of weight-biased leftist heaps from Agda to Haskell so I won’t go into technical details. As usual you can view the code on Github.
Tagsagda automata benchmarking c cabal coinduction combinatory logic compilers coq cuda eclipse eclipsefp emacs erlang ffi folds games ghc haskell hcar hunit IDE idris java lambda calculus leksah llvm matlab OCaml openSUSE prolog quickcheck quine racket recursion repa ruby scala scheme sml stg template-haskell testing troubleshooting types