* Practical type inference for arbitrary-rank types. SPJ, Dimitrios Vytiniotis, Stephanie Weirich, and MS. in JFP. * Lexically-scoped type variables. SPJ MS. Unpublished. * First-class modules for Haskell. MS SPJ. In FOOL 9. * Object-Oriented style overloading for Haskell. MS SPJ. In BABEL'01. * Static types for dynamic documents. MS. PhD Thesis. * Type-Indexed Rows. MS and Erik Meijer. In POPL'01. * XMLambda: A functional programming language for constructing and manipulating XML documents. Erik Meijer and MS. Unpublished. * Implicit parameters: Dynamic scoping with static types. Jeffrey Lewis, MS, Erik Meijer and John Launchbury. In POPL'00. * Dynamic typing as staged type inference. MS, Tim Sheard and SPJ. In POPL'98. * Bridging the gulf: A common intermediate language for ML and Haskell. SPJ, John Launchbury, MS In POPL'98.
Constraint Functional-Logic Programming I am currently developing a Haskell library for constraint functional-logic programming. It is in an early alpha stage (does not support higher-order functions and implements no constraint solvers) but can already be used to mimic simple lazy functional-logic programs in Haskell. Monadic and Queue-Based Tree Search Insipred by Monadic Conctraint Programming by Tom Schrijvers et. al., I wrapped up some thoughts on the difference between monadic and queue-based tree search. Haskell idioms I did not understand before hacking them on my own When coding my first library for Hackage, I learned about two programming problems and their solutions in Haskell. I boiled them down to the essence and wrote two posts to share them. One on polyvariadic functions, the other on heterogeneous collections. To get an executable Haskell file simply strip off the .html suffix. Simple SAT Solver