https://wiki.haskell.org/api.php?action=feedcontributions&user=Tomaxer&feedformat=atomHaskellWiki - User contributions [en]2024-03-29T05:49:16ZUser contributionsMediaWiki 1.35.5https://wiki.haskell.org/index.php?title=Research_papers/Type_systems&diff=44539Research papers/Type systems2012-02-14T23:13:08Z<p>Tomaxer: /* Implicit parameters */ Updated dead links</p>
<hr />
<div>__TOC__<br />
<br />
==Haskell semantics==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/static-semantics.dvi.gz A static semantics for Haskell]<br />
:SL Peyton Jones and PL Wadler, (draft), Department of Computing Science, University of Glasgow, 1992. (Cited by 20)<br />
<br />
;[http://haskell.org/onlinereport/dynamic-semantics.dvi.gz A Dynamic Semantics for Haskell] <br />
:Kevin Hammond and Cordelia Hall, (draft), University of Glasgow, 1992, 23 pages.<br />
<br />
;[http://citeseer.ist.psu.edu/424440.html Typing Haskell in Haskell] <br />
:Mark P. Jones, In Proceedings of the 1999 Haskell Workshop, Paris, France, October 1999. Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht. (Cited by 66)<br />
<br />
;[http://www.pms.informatik.uni-muenchen.de/mitarbeiter/panne/haskell_libs/hsparser.html HParser]<br />
:A parser for Haskell written purely in Haskell (using the Happy parser generator).<br />
<br />
;[http://www.cse.ogi.edu/~hallgren/Talks/LHiH/ A Lexer for Haskell in Haskell]<br />
:Thomas Hallgren, PacSoft Oregon Graduate Institute, 14 January, 2002<br />
<br />
;[http://citeseer.ist.psu.edu/launchbury93natural.html A Natural Semantics for Lazy Evaluation]<br />
:John Launchbury, Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, 144--154, 1993.<br />
<br />
;[http://www.cs.nott.ac.uk/~gmh/papers/11.ps A Space Semantics for Core Haskell]<br />
:Adam Bakewell. Proc. 2000 Haskell Workshop. September 2001.<br />
<br />
;[http://www.ii.uni.wroc.pl/~dabi/Publications/Haskell10/pirog-biernacki-hs10.pdf A Systematic Derivation of the STG Machine Verified in Coq]<br />
:Maciej Pirog and Dariusz Biernacki. Haskell Workshop, 2010.<br />
<br />
==Pure type systems==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/henk.ps.gz Henk: a typed intermediate language]<br />
:SL Peyton Jones and E Meijer, Proceedings of the Types in Compilation Workshop, Amsterdam, June 1997.<br />
<br />
;[http://www.cs.uu.nl/~johanj/MSc/jwroorda/ Pure Type Systems for Functional Programming]<br />
:Jan-Willem Roorda, Masters Thesis, University of Utrecht, INF/SCR-00-13, available online, 2000<br />
<br />
==Dependent Types==<br />
<br />
;[http://www.cs.nott.ac.uk/~txa/publ/ydtm.pdf Why Dependent Types Matter]<br />
:Thorsten Altenkirch and Conor McBride and James McKinna, Manuscript, available online, April, 2005. (Cited by 7)<br />
<br />
;[http://strictlypositive.org/Easy.pdf Simply Easy! An Implementation of a Dependently Typed Lambda Calculus]<br />
:Andres Löh, Conor McBride and Wouter Swierstra, 2007.<br />
<br />
==Unboxed values==<br />
<br />
;[http://www.soi.city.ac.uk/~ross/papers/pointed.html Parametricity and Unboxing with Unpointed Types]<br />
:John Launchbury and Ross Paterson, European Symposium on Programming, LNCS, vol. 1058, pp. 204-218, Springer, Linkping, Sweden, 1996.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/unboxed-values.ps.Z Unboxed values as first class citizens]<br />
:SL Peyton Jones and J Launchbury, Functional Programming Languages and Computer Architecture (FPCA'91), Boston, LNCS 523, Springer Verlag, Sept 1991, pp636-666. (Cited by 105)<br />
<br />
==Modules==<br />
<br />
;[http://www.cse.ogi.edu/~diatchki/papers/modules98.pdf A Formal Specification of the Haskell 98 Module System]<br />
:Iavor S. Diatchki, Mark P. Jones, and Thomas Hallgren. Proceedings of the 2002 ACM SIGPLAN workshop on Haskell. Pittsburgh, Pennsylvania. 17 - 28 2002 ISBN 1-58113-605-6 (Cited by 12)<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/first-class-modules/index.htm First class modules for Haskell]<br />
:Mark Shields and Simon Peyton Jones; FOOL'02.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/Nicklisch-modules.ps.gz An exploration of modular programs]<br />
:Electronic proceedings of the 1996 Glasgow Functional Programming Workshop, J Nicklisch and SL Peyton Jones, Ullapool, July 1996.<br />
<br />
== Modular monadic typechecker ==<br />
<br />
;[http://www.haskell.org/wikiupload/f/f5/Types2.pdf.zip Adaptable Software - Modular Extensible Monadic Entry-pointless Type Checker in Haskell]<br />
:Ro/Haskell Group, Univ. “V.Alecsandri”, Bacau, Romania, 2011<br />
<br />
==Exceptions==<br />
<br />
;[http://www.haskell.org/~simonmar/papers/ext-exceptions.pdf An Extensible Dynamically-Typed Hierarchy of Exceptions]<br />
:Simon Marlow. Haskell '06: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, Portland, Oregon, ACM Press, September 2006<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/imprecise-exn-sem.htm Imprecise Exceptions, Co-Inductively]<br />
:Andy Moran, Soeren Lassen, and Simon Peyton Jones. HOOTS'99.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/imprecise-exn.htm A semantics for imprecise exceptions]<br />
:Simon Peyton Jones, Alastair Reid, Tony Hoare, Simon Marlow, Fergus Henderson. Proc Programming Language Design and Implementation (PLDI'99), Atlanta.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm Asynchronous exceptions in Haskell]<br />
:Simon Marlow, Simon Peyton Jones, Andy Moran and John Reppy, PLDI'01.<br />
<br />
;[http://www.reid-consulting-uk.ltd.uk/alastair/publications/except6.ps.gz Handling Exceptions in Haskell]<br />
:A. Reid, Research Report YALEU/DCS/RR-1175, Yale University, August, 1998<br />
<br />
==Lexically scoped type variables==<br />
<br />
;[http://research.microsoft.com/%7Esimonpj/papers/scoped%2Dtyvars/ Lexically scoped type variables]<br />
:Simon Peyton Jones and Mark Shields. 2004.<br />
<br />
==Records==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/records.htm Lightweight Extensible Records for Haskell]<br />
:Mark Jones and Simon Peyton Jones, Haskell Workshop 1999.<br />
<br />
;[http://www.cs.uu.nl/~daan/download/papers/scopedlabels.pdf Extensible records with scoped labels]<br />
:Daan Leijen. The 2005 Symposium on Trends in Functional Programming (TFP'05), Tallin, Estonia, September 2005.<br />
<br />
;[http://www.cs.uu.nl/~daan/download/papers/fclabels.pdf First-class labels for extensible rows]<br />
:Daan Leijen. Technical Report UU-CS-2004-51, Departement of Computer Science, Universiteit Utrecht, 2004.<br />
<br />
;[http://www.reid-consulting-uk.ltd.uk/alastair/publications/h-wkshop95a/index.html Haskell Records]<br />
:J. Peterson, A. Reid, Proceedings of the Haskell Workshop, La Jolla, June 1995. <br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/96-3.ps.gz A Polymorphic Type System for Extensible Records and Variants]<br />
:Benedict R. Gaster and Mark P. Jones. Department of Computer Science, University of Nottingham. Technical report NOTTCS-TR-96-3. November 1996.<br />
<br />
==Meta programming==<br />
<br />
;[http://research.microsoft.com/copyright/accept.asp?path=/users/simonpj/papers/dyntyping.ps.gz&pub=ACM Dynamic typing as staged type inference]<br />
:MB Shields, T Sheard, and SL Peyton Jones, POPL98.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/meta-haskell/index.htm Template meta-programming for Haskell]<br />
:Tim Sheard and Simon Peyton Jones, Proceedings of the Haskell Workshop, Pittsburgh, 2002<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/SCK04.html Optimising Embedded DSLs using Template Haskell]<br />
:Sean Seefried, Manuel M. T. Chakravarty, and Gabriele Keller. In Gabor Karsai and Eelco Visser, editors, Third International Conference on Generative Programming and Component Engineering (GPCE'04), LNCS 3286, Springer-Verlag, pages 186-205, 2004. [An earlier draft was presented at the IFL 2003 - 15th International Workshop on the Implementation of Functional Languages, 2003.<br />
<br />
;[http://www.haskell.org/th/papers/Unrolling_and_Simplifying_Expressions_with_Template_Haskell.ps Unrolling and Simplifying Expressions with Template Haskell]<br />
:Ian Lynagh, May 2003.<br />
<br />
;[http://www.haskell.org/th/papers/hlpp.ps Automatic skeletons in Template Haskell]<br />
:Kevin Hammond, Jost Berthold and Rita Loogen, June 2003. Proceedings of 2003 Workshop on High Level Parallel Programming, Paris, France<br />
<br />
;[http://www.haskell.org/th/papers/Typing_Template_Haskell__Soft_Types.ps Typing Template Haskell: Soft Types]<br />
:Ian Lynagh, August 2004.<br />
<br />
==Dynamic typing==<br />
<br />
;[http://www.cs.uu.nl/groups/ST/stbib/swierstra-by-year/BaSw02.bib Typing dynamic typing]<br />
:A. I. Baars and S. D. Swierstra. In S. Peyton Jones, editor, Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 157--166. ACM Press, 2002<br />
<br />
==Parametricity==<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/free/free.ps.gz Theorems for free!]<br />
:Philip Wadler. 4'th International Conference on Functional Programming and Computer Architecture, London, September 1989.<br />
<br />
;[http://www.soi.city.ac.uk/~ross/papers/pointed.html Parametricity and Unboxing with Unpointed Types]<br />
:John Launchbury and Ross Paterson, European Symposium on Programming, LNCS, vol. 1058, pp. 204-218, Springer, Linkping, Sweden, 1996.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/seqFinal.pdf The Impact of seq on Free Theorems-Based Program Transformations]<br />
:Patricia Johann and Janis Voigtländer, Fundamenta Informaticae, vol. 69(1-2), pp. 63-102, 2006.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/TCS.pdf Selective strictness and parametricity in structural operational semantics, inequationally]<br />
:Janis Voigtländer and Patricia Johann, Theoretical Computer Science, vol. 388(1-3), pp. 290-318, 2007.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/pepm09-voigtlaender.pdf Proving Correctness via Free Theorems: The Case of the destroy/build-Rule]<br />
:Janis Voigtländer. Workshop on Partial Evaluation and Program Manipulation (PEPM'08), Proceedings, ACM Press, 2008.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/iandc.pdf A family of syntactic logical relations for the semantics of Haskell-like languages]<br />
:Patricia Johann and Janis Voigtländer, Information and Computation, vol. 207(2), pp. 341-368, 2009.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/tlca09.pdf Parametricity for Haskell with Imprecise Error Semantics]<br />
:Florian Stenger and Janis Voigtländer. International Conference on Typed Lambda Calculi and Applications (TLCA'09), Proceedings, Springer-Verlag, 2009.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/icfp09.pdf Free Theorems Involving Type Constructor Classes]<br />
:Janis Voigtländer. International Conference on Functional Programming (ICFP'09), Proceedings, ACM Press, 2009.<br />
<br />
;[http://www.iai.uni-bonn.de/~jv/FTForCurry.pdf Free Theorems for Functional Logic Programs]<br />
:Jan Christiansen, Daniel Seidel, and Janis Voigtländer. Programming Languages meets Program Verification (PLPV'10), Proceedings, ACM Press, 2010.<br />
<br />
;[http://www.iai.uni-bonn.de/~jv/paper.pdf Automatically Generating Counterexamples to Naive Free Theorems]<br />
:Daniel Seidel and Janis Voigtländer. Functional and Logic Programming (FLOPS'10), Proceedings, Springer-Verlag, 2010.<br />
<br />
;[http://www.iai.uni-bonn.de/~jv/acta.pdf Refined Typing to Localize the Impact of Forced Strictness on Free Theorems]<br />
:Daniel Seidel and Janis Voigtländer, Acta Informatica, vol. 48(3), pp. 191-211, 2011.<br />
<br />
==Type classes==<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/class/class.ps.gz How to make ad-hoc polymorphism less ad hoc]<br />
:Philip Wadler and Stephen Blott. 16'th Symposium on Principles of Programming Languages, ACM Press, Austin, Texas, January 1989.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/classhask.ps.gz Type classes in Haskell, CV Hall, K Hammond, SL Peyton Jones, and PL Wadler]<br />
:European Symposium On Programming, LNCS 788, Springer Verlag, pp. 241-256, April 1994. (Cited by 131)<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/pldi93.html Implementing Type Classes]<br />
:John Peterson and Mark P. Jones, In Proceedings of ACM SIGPLAN Symposium on Programming Language Design and Implementation, ACM SIGPLAN, June 1993. (Cited by 40)<br />
<br />
;[http://www.cs.chalmers.se/pub/cs-reports/papers/overload-fpca-93.ps.Z Implementing Haskell overloading]<br />
:Lennart Augustsson, 1993. FPCA. 65-73<br />
<br />
;[http://web.cecs.pdx.edu/~mpj/pubs/springschool.html Functional Programming with Overloading and Higher-Order Polymorphism]<br />
:Mark P. Jones, First International Spring School on Advanced Functional Programming Techniques, Baastad, Sweden, Springer-Verlag Lecture Notes in Computer Science 925, May 1995.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/type-class-design-space Type classes: exploring the design space]<br />
:Simon Peyton Jones, Mark Jones, Erik Meijer, Haskell Workshop 1997.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/fpca93.html A system of constructor classes: overloading and implicit higher-order polymorphism]<br />
:Mark P. Jones, In FPCA '93: Conference on Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, June 1993.<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/overload2/overload2.ps.gz A second look at overloading]<br />
:Martin Odersky, Philip Wadler, Martin Wehr. 7'th International Conference on Functional Programming and Computer Architecture, ACM Press, San Diego, California, June 1995.<br />
<br />
;[http://citeseer.ist.psu.edu/laufer94combining.html Combining Type Classes and Existential Types]<br />
:Konstantin Laufer, Proceedings of the Latin American Informatic Conference (PANEL), 1994<br />
<br />
;[http://citeseer.ist.psu.edu/aufer95type.html Type Classes with Existential Types]<br />
:Konstantin Laufer, Journal of Functional Programming, 1996, May<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/DHCK06.html Modular Type Classes]<br />
:Derek Dreyer, Robert Harper, Manuel M.T. Chakravarty and Gabriele Keller, 2006<br />
<br />
;[http://www.informatik.uni-bonn.de/~ralf/hw2001/4.pdf Named instances for Haskell type classes]<br />
:W Kahl, J Scheffczyk - Proc. Haskell Workshop, 2001 (Cited by 12)<br />
<br />
===Deriving type classes===<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/derive.htm Derivable Type classes] <br />
:Ralf Hinze and Simon Peyton Jones, Haskell Workshop 2000.<br />
<br />
;[http://www.cis.upenn.edu/~sweirich/RepLib/ RepLib: A Library for Derivable Type Classes]<br />
:Stephanie Weirich 2006<br />
<br />
===Applications of type classes===<br />
<br />
;[http://okmij.org/ftp/Haskell/number-parameterized-types.html Number-parameterized types]<br />
:Oleg Kiselyov, The Monad.Reader. IssueFive. Oct 2nd, 2005<br />
<br />
;[http://web.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/typecase.pdf TypeCase: a design pattern for type-indexed functions]<br />
:Bruno C. d. S. Oliveira, Jeremy Gibbons. Proceedings of the 2005 ACM SIGPLAN workshop on Haskell. Tallinn, Estonia. 98 - 109, 2005 ISBN:1-59593-071-X<br />
<br />
;[http://okmij.org/ftp/Haskell/types.html#Prepose Functional pearl: implicit configurations--or, type classes reflect the values of types]<br />
:Oleg Kiselyov, Chung-chieh Shan, Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, Snowbird, Utah, USA, 2004 ISBN 1-58113-850-4<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/extract-typeclassproofs.pdf Extracting Programs from Type Class Proofs]<br />
:Martin Sulzmann, 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/coind-type-class-proofs.ps Co-induction and Type Improvement in Type Class Proofs]<br />
:Martin Sulzmann, Jeremy Wazny and Peter J. Stuckey. 2005<br />
<br />
;[http://www.cs.nott.ac.uk/~ctm/faking.ps.gz Faking It (Simulating Dependent Types in Haskell)]<br />
:Conor McBride, Journal of Functional Programming, 12(4&5):375-392, July 2002<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/aophaskell.ps.gz Aspect-Oriented Programming with Type Classes]<br />
:Martin Sulzmann and Meng Wang, 2006.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/mpc08.pdf Asymptotic Improvement of Computations over Free Monads]<br />
:Janis Voigtländer. Mathematics of Program Construction (MPC'08), Proceedings, LNCS 5133:388-403, Springer-Verlag, 2008.<br />
<br />
<br />
==Undecidable instances==<br />
<br />
;[http://www.haskell.org/ghc/docs/6.4.2/html/users_guide/type-extensions.html#undecidable-instances Undecidable instances]<br />
:GHC User's Guide.<br />
<br />
==Multi-parameter type classes==<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/ghc-mptc-inf.ps Principal Type Inference for GHC-Style Multi-Parameter Type Classes]<br />
:Martin Sulzmann, Tom Schrijvers and Peter J. Stuckey. In APLAS'06.<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/mptc-inf-old.pdf Type Inference for Multi-Parameter Type Classes]<br />
:Martin Sulzmann and Peter J. Stuckey. 2005<br />
<br />
;[http://ostrich.lcs.mit.edu/cgi-bin/pickbib?jfp::DugganO2002 Type-checking multi-parameter type classes]<br />
:Dominic Duggan and John Ophel, Journal of Functional Programming, 12(2):133-158, March 2002<br />
<br />
==Functional dependencies==<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/fundeps.html Type Classes with Functional Dependencies]<br />
:Mark P. Jones, In Proceedings of the 9th European Symposium on Programming, ESOP 2000, Berlin, Germany, March 2000, Springer-Verlag LNCS 1782.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/fd-chr/index.htm Sound and Decidable Type Inference for Functional Dependencies]<br />
:Gregory J. Duck, Simon Peyton Jones, Peter J. Stuckey, and Martin Sulzmann, European Symposium on Programming 2004 (ESOP'04).<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/jfp-fds-revised.pdf Understanding Functional Dependencies via Constraint Handling Rules]<br />
:Martin Sulzmann, Gregory J. Duck, Simon Peyton-Jones and Peter J. Stuckey.j To appear in Journal of Functional Programming. 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/afds.ps Associated Functional Dependencies]<br />
:Martin Sulzmann and Edmund Soon Lee Lam. 2005<br />
<br />
==Constraint Handling Rules==<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/aplas06-invited.pdf Type Processing by Constraint Reasoning]<br />
:Peter J. Stuckey, Martin Sulzmann and Jeremy Wazny, In APLAS'06.<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/chr-stm.ps A Concurrent Constraint Handling Rules Implementation in Haskell with Software Transactional Memory]<br />
:Edmund S.L. Lam and Martin Sulzmann<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/chr06-observable.ps Observable Confluence for Constraint Handling Rules]<br />
:Gregory J. Duck, Peter J. Stuckey and Martin Sulzmann<br />
<br />
==Generalised Algebraic Data Types (GADTs)==<br />
<br />
;[http://research.microsoft.com/~simonpj/papers/gadt/index.htm Simple unification-based type inference for GADTs]<br />
:Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Submitted to PLDI 2005<br />
<br />
;[http://www.cis.upenn.edu/~geoffw/research/papers/MS-CIS-05-26.pdf Wobbly types: type inference for generalised algebraic data types]<br />
:S Peyton Jones, G. Washburn, and S. Weirich. 2004.<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/simple-translate-gadts.ps Translating Generalized Algebraic Data Types to System F]<br />
:Martin Sulzmann and Meng Wang. 2005<br />
<br />
;[http://cristal.inria.fr/~fpottier/publis/pottier-regis-gianas-05.pdf Stratified type inference for generalized algebraic data types]<br />
:François Pottier and Yann Régis-Gianas, 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/gadt-short.ps Type Inference for GADTs via Herbrand Constraint Abduction]<br />
:Martin Sulzmann, Tom Schrijvers and Peter J. Stuckey, 2006 <br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/tr-eadt.ps.gz A Framework for Extended Algebraic Data Types]<br />
:Martin Sulzmann, Jeremy Wazny and Peter J. Stuckey, 2006<br />
<br />
;[http://www.cs.kuleuven.be/~toms/Research/papers/implication_constraints.pdf Complete and Decidable Type Inference for GADTs]<br />
:Tom Schrijvers, Simon Peyton-Jones, Martin Sulzmann and Dimitrios Vytiniotis, 2009.<br />
<br />
;[http://web.cecs.pdx.edu/~cklin/pointwise/pointwise-tldi10.pdf Pointwise Generalized Algebraic Data Types]<br />
:Chuan-kai Lin and Tim Sheard, 2010.<br />
<br />
See also the [[GADT]] page.<br />
<br />
==Parametric Regular Data Types==<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/parametric-regular.ps Type Inference and Compilation for Parametric Regular Data Types]<br />
:Martin Sulzmann and Kenny Zhuo Ming Lu, 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/haskell-xduce.ps The Marriage of Haskell and XDuce]<br />
:Martin Sulzmann and Kenny Zhuo Ming Lu<br />
<br />
==Type Families and Associated types==<br />
<br />
;[http://www.haskell.org/~simonmar/papers/assoc.pdf Associated types with class]<br />
:Manuel M. T. Chakravarty, Gabriele Keller, Simon Peyton Jones, Simon Marlow) POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages, pages 1--13, Long Beach, California, USA, ACM Press, 2005<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/CKP05.html Associated Type Synonyms]<br />
:Manuel M. T. Chakravarty, Gabriele Keller, and Simon Peyton Jones. In Proceedings of The Tenth ACM SIGPLAN International Conference on Functional Programming, ACM Press, pages 241-253, 2005.<br />
<br />
;[http://www.informatik.uni-freiburg.de/~wehr/diplom ML Modules and Haskell Type Classes: A Constructive Comparison]<br />
:Stefan Wehr Diplomarbeit. Albert-Ludwigs-Universitt Freiburg, Fakultt fr Angewandte Wissenschaften, Institut fr Informatik, November 2005. <br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/SCP06.html System F with Type Equality Coercions]<br />
:Martin Sulzmann, Manuel M. T. Chakravarty, and Simon Peyton Jones.<br />
<br />
;[http://www.cs.kuleuven.be/~toms/Research/papers/type_functions.pdf Towards Open Type Functions for Haskell]<br />
:Tom Schrijvers, Simon Peyton Jones, Martin Sulzmann, and Manuel Chakravarty. In Proceedings of IFL' 07, Freiburg, Germany, 2007.<br />
<br />
;[http://www.cs.kuleuven.be/~toms/Research/papers/draft_type_functions_2008.pdf Type Checking with Open Type Functions for Haskell]<br />
:Tom Schrijvers, Simon Peyton Jones, Manuel Chakravarty, and Martin Sulzmann. In Proceedings of ICFP' 08, Victoria, Canada, 2008.<br />
<br />
<br />
==Arbitrary-rank polymorphism==<br />
<br />
;[http://www.ubka.uni-karlsruhe.de/vvv/1996/informatik/81/81.pdf.gz Putting type annotations to work]<br />
:Martin Odersky and Konstantin Läufer. Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. St. Petersburg Beach, Florida, United States. 54 - 67 1996 ISBN 0-89791-769-3<br />
<br />
;[http://journals.cambridge.org/production/action/cjoGetFulltext%3Ffulltextid%3D445910 Practical type inference for arbitrary-rank types]<br />
:SP Jones, M Shields - Submitted to the Journal of Functional Programming, 2005<br />
<br />
==Phantom types==<br />
<br />
;[http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1901 First-class phantom types]<br />
:James Cheney and Ralf Hinze. Technical Report TR2003-1901, Cornell University, 2003.<br />
<br />
;[http://ttic.uchicago.edu/~fluet/research/phantom-subtyping/jfp06/jfp06.pdf Phantom Types and Subtyping]<br />
:Matthew Fluet and Riccardo Pucella. Submitted to the Journal of Functional Programming, 2006.<br />
<br />
==Implicit parameters==<br />
<br />
;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.46.9849 Implicit Parameters: Dynamic Scoping with Static Types]<br />
:Jeffrey Lewis, Mark Shields, Erik Meijer and John Launchbury. POPL'00. 2000.<br />
<br />
;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.145 Global variables in Haskell]<br />
:John Hughes. J. Funct. Program. 14(5): 489-502 (2004) <br />
<br />
;[http://www.cs.uu.nl/pub/RUU/CS/techreps/CS-2004/2004-059.pdf Explicit Implicit Parameters]<br />
:A. Dijkstra and S. D. Swierstra. UU-CS 2004-059, 2004.<br />
<br />
==Object oriented Haskell==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/oo-haskell/index.htm Object-Oriented Style Overloading for Haskell] <br />
:Mark Shields and Simon Peyton Jones; BABEL workshop '01.<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/PC03.html Interfacing Haskell with Object-Oriented Languages]<br />
:Andr T. H. Pang and Manuel M. T. Chakravarty. In Greg Michaelson and Phil Trinder, editors, Implementation of Functional Languages: 15th International Workshop, IFL 2003, Edinburgh, UK, September 8-11, 2003, Revised Papers, LNCS 3145, Springer-Verlag, pages 20-36, 2004. <br />
<br />
;[http://citeseer.ist.psu.edu/118134.html Haskell++: An Object-Oriented Extension of Haskell]<br />
:Jan Sparud and John Hughes. Haskell Workshop 1995<br />
<br />
;[http://homepages.cwi.nl/~ralf/OOHaskell/ Haskell's overlooked object system]<br />
:Oleg Kiselyov and Ralf Lämmel, submitted for journal publication; online since 30 Sep. 2004;<br />
<br />
==Restricted Datatypes==<br />
<br />
;[http://www.cs.utexas.edu/users/ham/richards/FP%20papers/restricted-datatypes.pdf Restricted datatypes]<br />
:John Hughes. 1999 Haskell workshop<br />
<br />
==Patterns==<br />
<br />
;[http://www.cs.yale.edu/homes/tullsen/patterns.ps First Class Patterns]<br />
:Mark Tullsen. Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000. volume 1753 of Lecture Notes in Computer Science. January 2000. <br />
<br />
===Pattern guards===<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/pat.htm Pattern Guards and Transformational Patterns]<br />
:Martin Erwig and Simon Peyton Jones; Haskell Workshop 2000.<br />
<br />
;[http://research.microsoft.com/Users/simonpj/Haskell/guards.html A new view of guards]<br />
:Simon Peyton Jones, April 1997<br />
<br />
===Views===<br />
<br />
;[http://www.haskell.org/development/views.html Views: An Extension to Haskell Pattern Matching]<br />
:Warren Burton, Erik Meijer, Patrick Sansom, Simon Thompson and Phil Wadler.<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/view/view.ps.gz Views: A way for pattern matching to cohabit with data abstraction]<br />
:POPL 14 (1987), 307-313.<br />
<br />
==Qualified types==<br />
<br />
;[http://haskell.readscheme.org/servlets/cite.ss?pattern=mpj-jones1994a Qualified Types: Theory and Practice]<br />
:Mark P. Jones. PhD. Thesis. Yale University. November 1994.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/fpca95.ps Simplifying and Improving Qualified Types]<br />
:Mark P. Jones. FPCA '95: Conference on Functional Programming Languages and Computer Architecture. June 1995.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/RR-1040.ps Simplifying and Improving Qualified Types]<br />
:Mark P. Jones. Yale University. Research Report YALEU/DCS/RR-1040. June 1994.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/RR-989.ps Coherence for qualified types]<br />
:Mark P. Jones. Yale University. Research Report YALEU/DCS/RR-989. September 1993. <br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/rev-qual-types.ps A theory of qualified types]<br />
:Mark P. Jones. ESOP '92: European Symposium on Programming. Lecture Notes in Computer Science, 582. February 1992. (Cited by 68)<br />
<br />
==Polymorphic recursion==<br />
<br />
;[http://portal.acm.org/citation.cfm%3Fcoll%3DGUIDE%26dl%3DGUIDE%26id%3D169692 Type inference with polymorphic recursion]<br />
:F Henglein - ACM Transactions on Programming Languages and Systems (1993)<br />
<br />
;[http://www.jucs.org/jucs_9_8/practical_type_inference_for/paper.pdf Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell]<br />
:C Vasconcellos, L Figueiredo, C Camarao - Journal of Universal Computer Science, 2003<br />
<br />
;[http://www.dcc.ufmg.br/~camarao/ml0-impl.ps Type Inference for Polymorphic Recursive Definitions: a Specification in Haskell]<br />
:L Figueiredo, C Camarao<br />
<br />
[[Category:Research]]<br />
[[Category:Type-level programming]]</div>Tomaxerhttps://wiki.haskell.org/index.php?title=Research_papers/Type_systems&diff=44538Research papers/Type systems2012-02-14T22:56:05Z<p>Tomaxer: /* Restricted Datatypes */ Updated dead link</p>
<hr />
<div>__TOC__<br />
<br />
==Haskell semantics==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/static-semantics.dvi.gz A static semantics for Haskell]<br />
:SL Peyton Jones and PL Wadler, (draft), Department of Computing Science, University of Glasgow, 1992. (Cited by 20)<br />
<br />
;[http://haskell.org/onlinereport/dynamic-semantics.dvi.gz A Dynamic Semantics for Haskell] <br />
:Kevin Hammond and Cordelia Hall, (draft), University of Glasgow, 1992, 23 pages.<br />
<br />
;[http://citeseer.ist.psu.edu/424440.html Typing Haskell in Haskell] <br />
:Mark P. Jones, In Proceedings of the 1999 Haskell Workshop, Paris, France, October 1999. Published in Technical Report UU-CS-1999-28, Department of Computer Science, University of Utrecht. (Cited by 66)<br />
<br />
;[http://www.pms.informatik.uni-muenchen.de/mitarbeiter/panne/haskell_libs/hsparser.html HParser]<br />
:A parser for Haskell written purely in Haskell (using the Happy parser generator).<br />
<br />
;[http://www.cse.ogi.edu/~hallgren/Talks/LHiH/ A Lexer for Haskell in Haskell]<br />
:Thomas Hallgren, PacSoft Oregon Graduate Institute, 14 January, 2002<br />
<br />
;[http://citeseer.ist.psu.edu/launchbury93natural.html A Natural Semantics for Lazy Evaluation]<br />
:John Launchbury, Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, South Carolina, 144--154, 1993.<br />
<br />
;[http://www.cs.nott.ac.uk/~gmh/papers/11.ps A Space Semantics for Core Haskell]<br />
:Adam Bakewell. Proc. 2000 Haskell Workshop. September 2001.<br />
<br />
;[http://www.ii.uni.wroc.pl/~dabi/Publications/Haskell10/pirog-biernacki-hs10.pdf A Systematic Derivation of the STG Machine Verified in Coq]<br />
:Maciej Pirog and Dariusz Biernacki. Haskell Workshop, 2010.<br />
<br />
==Pure type systems==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/henk.ps.gz Henk: a typed intermediate language]<br />
:SL Peyton Jones and E Meijer, Proceedings of the Types in Compilation Workshop, Amsterdam, June 1997.<br />
<br />
;[http://www.cs.uu.nl/~johanj/MSc/jwroorda/ Pure Type Systems for Functional Programming]<br />
:Jan-Willem Roorda, Masters Thesis, University of Utrecht, INF/SCR-00-13, available online, 2000<br />
<br />
==Dependent Types==<br />
<br />
;[http://www.cs.nott.ac.uk/~txa/publ/ydtm.pdf Why Dependent Types Matter]<br />
:Thorsten Altenkirch and Conor McBride and James McKinna, Manuscript, available online, April, 2005. (Cited by 7)<br />
<br />
;[http://strictlypositive.org/Easy.pdf Simply Easy! An Implementation of a Dependently Typed Lambda Calculus]<br />
:Andres Löh, Conor McBride and Wouter Swierstra, 2007.<br />
<br />
==Unboxed values==<br />
<br />
;[http://www.soi.city.ac.uk/~ross/papers/pointed.html Parametricity and Unboxing with Unpointed Types]<br />
:John Launchbury and Ross Paterson, European Symposium on Programming, LNCS, vol. 1058, pp. 204-218, Springer, Linkping, Sweden, 1996.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/unboxed-values.ps.Z Unboxed values as first class citizens]<br />
:SL Peyton Jones and J Launchbury, Functional Programming Languages and Computer Architecture (FPCA'91), Boston, LNCS 523, Springer Verlag, Sept 1991, pp636-666. (Cited by 105)<br />
<br />
==Modules==<br />
<br />
;[http://www.cse.ogi.edu/~diatchki/papers/modules98.pdf A Formal Specification of the Haskell 98 Module System]<br />
:Iavor S. Diatchki, Mark P. Jones, and Thomas Hallgren. Proceedings of the 2002 ACM SIGPLAN workshop on Haskell. Pittsburgh, Pennsylvania. 17 - 28 2002 ISBN 1-58113-605-6 (Cited by 12)<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/first-class-modules/index.htm First class modules for Haskell]<br />
:Mark Shields and Simon Peyton Jones; FOOL'02.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/Nicklisch-modules.ps.gz An exploration of modular programs]<br />
:Electronic proceedings of the 1996 Glasgow Functional Programming Workshop, J Nicklisch and SL Peyton Jones, Ullapool, July 1996.<br />
<br />
== Modular monadic typechecker ==<br />
<br />
;[http://www.haskell.org/wikiupload/f/f5/Types2.pdf.zip Adaptable Software - Modular Extensible Monadic Entry-pointless Type Checker in Haskell]<br />
:Ro/Haskell Group, Univ. “V.Alecsandri”, Bacau, Romania, 2011<br />
<br />
==Exceptions==<br />
<br />
;[http://www.haskell.org/~simonmar/papers/ext-exceptions.pdf An Extensible Dynamically-Typed Hierarchy of Exceptions]<br />
:Simon Marlow. Haskell '06: Proceedings of the 2006 ACM SIGPLAN workshop on Haskell, Portland, Oregon, ACM Press, September 2006<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/imprecise-exn-sem.htm Imprecise Exceptions, Co-Inductively]<br />
:Andy Moran, Soeren Lassen, and Simon Peyton Jones. HOOTS'99.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/imprecise-exn.htm A semantics for imprecise exceptions]<br />
:Simon Peyton Jones, Alastair Reid, Tony Hoare, Simon Marlow, Fergus Henderson. Proc Programming Language Design and Implementation (PLDI'99), Atlanta.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/asynch-exns.htm Asynchronous exceptions in Haskell]<br />
:Simon Marlow, Simon Peyton Jones, Andy Moran and John Reppy, PLDI'01.<br />
<br />
;[http://www.reid-consulting-uk.ltd.uk/alastair/publications/except6.ps.gz Handling Exceptions in Haskell]<br />
:A. Reid, Research Report YALEU/DCS/RR-1175, Yale University, August, 1998<br />
<br />
==Lexically scoped type variables==<br />
<br />
;[http://research.microsoft.com/%7Esimonpj/papers/scoped%2Dtyvars/ Lexically scoped type variables]<br />
:Simon Peyton Jones and Mark Shields. 2004.<br />
<br />
==Records==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/records.htm Lightweight Extensible Records for Haskell]<br />
:Mark Jones and Simon Peyton Jones, Haskell Workshop 1999.<br />
<br />
;[http://www.cs.uu.nl/~daan/download/papers/scopedlabels.pdf Extensible records with scoped labels]<br />
:Daan Leijen. The 2005 Symposium on Trends in Functional Programming (TFP'05), Tallin, Estonia, September 2005.<br />
<br />
;[http://www.cs.uu.nl/~daan/download/papers/fclabels.pdf First-class labels for extensible rows]<br />
:Daan Leijen. Technical Report UU-CS-2004-51, Departement of Computer Science, Universiteit Utrecht, 2004.<br />
<br />
;[http://www.reid-consulting-uk.ltd.uk/alastair/publications/h-wkshop95a/index.html Haskell Records]<br />
:J. Peterson, A. Reid, Proceedings of the Haskell Workshop, La Jolla, June 1995. <br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/96-3.ps.gz A Polymorphic Type System for Extensible Records and Variants]<br />
:Benedict R. Gaster and Mark P. Jones. Department of Computer Science, University of Nottingham. Technical report NOTTCS-TR-96-3. November 1996.<br />
<br />
==Meta programming==<br />
<br />
;[http://research.microsoft.com/copyright/accept.asp?path=/users/simonpj/papers/dyntyping.ps.gz&pub=ACM Dynamic typing as staged type inference]<br />
:MB Shields, T Sheard, and SL Peyton Jones, POPL98.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/meta-haskell/index.htm Template meta-programming for Haskell]<br />
:Tim Sheard and Simon Peyton Jones, Proceedings of the Haskell Workshop, Pittsburgh, 2002<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/SCK04.html Optimising Embedded DSLs using Template Haskell]<br />
:Sean Seefried, Manuel M. T. Chakravarty, and Gabriele Keller. In Gabor Karsai and Eelco Visser, editors, Third International Conference on Generative Programming and Component Engineering (GPCE'04), LNCS 3286, Springer-Verlag, pages 186-205, 2004. [An earlier draft was presented at the IFL 2003 - 15th International Workshop on the Implementation of Functional Languages, 2003.<br />
<br />
;[http://www.haskell.org/th/papers/Unrolling_and_Simplifying_Expressions_with_Template_Haskell.ps Unrolling and Simplifying Expressions with Template Haskell]<br />
:Ian Lynagh, May 2003.<br />
<br />
;[http://www.haskell.org/th/papers/hlpp.ps Automatic skeletons in Template Haskell]<br />
:Kevin Hammond, Jost Berthold and Rita Loogen, June 2003. Proceedings of 2003 Workshop on High Level Parallel Programming, Paris, France<br />
<br />
;[http://www.haskell.org/th/papers/Typing_Template_Haskell__Soft_Types.ps Typing Template Haskell: Soft Types]<br />
:Ian Lynagh, August 2004.<br />
<br />
==Dynamic typing==<br />
<br />
;[http://www.cs.uu.nl/groups/ST/stbib/swierstra-by-year/BaSw02.bib Typing dynamic typing]<br />
:A. I. Baars and S. D. Swierstra. In S. Peyton Jones, editor, Proceedings of the seventh ACM SIGPLAN international conference on Functional programming, pages 157--166. ACM Press, 2002<br />
<br />
==Parametricity==<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/free/free.ps.gz Theorems for free!]<br />
:Philip Wadler. 4'th International Conference on Functional Programming and Computer Architecture, London, September 1989.<br />
<br />
;[http://www.soi.city.ac.uk/~ross/papers/pointed.html Parametricity and Unboxing with Unpointed Types]<br />
:John Launchbury and Ross Paterson, European Symposium on Programming, LNCS, vol. 1058, pp. 204-218, Springer, Linkping, Sweden, 1996.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/seqFinal.pdf The Impact of seq on Free Theorems-Based Program Transformations]<br />
:Patricia Johann and Janis Voigtländer, Fundamenta Informaticae, vol. 69(1-2), pp. 63-102, 2006.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/TCS.pdf Selective strictness and parametricity in structural operational semantics, inequationally]<br />
:Janis Voigtländer and Patricia Johann, Theoretical Computer Science, vol. 388(1-3), pp. 290-318, 2007.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/pepm09-voigtlaender.pdf Proving Correctness via Free Theorems: The Case of the destroy/build-Rule]<br />
:Janis Voigtländer. Workshop on Partial Evaluation and Program Manipulation (PEPM'08), Proceedings, ACM Press, 2008.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/iandc.pdf A family of syntactic logical relations for the semantics of Haskell-like languages]<br />
:Patricia Johann and Janis Voigtländer, Information and Computation, vol. 207(2), pp. 341-368, 2009.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/tlca09.pdf Parametricity for Haskell with Imprecise Error Semantics]<br />
:Florian Stenger and Janis Voigtländer. International Conference on Typed Lambda Calculi and Applications (TLCA'09), Proceedings, Springer-Verlag, 2009.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/icfp09.pdf Free Theorems Involving Type Constructor Classes]<br />
:Janis Voigtländer. International Conference on Functional Programming (ICFP'09), Proceedings, ACM Press, 2009.<br />
<br />
;[http://www.iai.uni-bonn.de/~jv/FTForCurry.pdf Free Theorems for Functional Logic Programs]<br />
:Jan Christiansen, Daniel Seidel, and Janis Voigtländer. Programming Languages meets Program Verification (PLPV'10), Proceedings, ACM Press, 2010.<br />
<br />
;[http://www.iai.uni-bonn.de/~jv/paper.pdf Automatically Generating Counterexamples to Naive Free Theorems]<br />
:Daniel Seidel and Janis Voigtländer. Functional and Logic Programming (FLOPS'10), Proceedings, Springer-Verlag, 2010.<br />
<br />
;[http://www.iai.uni-bonn.de/~jv/acta.pdf Refined Typing to Localize the Impact of Forced Strictness on Free Theorems]<br />
:Daniel Seidel and Janis Voigtländer, Acta Informatica, vol. 48(3), pp. 191-211, 2011.<br />
<br />
==Type classes==<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/class/class.ps.gz How to make ad-hoc polymorphism less ad hoc]<br />
:Philip Wadler and Stephen Blott. 16'th Symposium on Principles of Programming Languages, ACM Press, Austin, Texas, January 1989.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/classhask.ps.gz Type classes in Haskell, CV Hall, K Hammond, SL Peyton Jones, and PL Wadler]<br />
:European Symposium On Programming, LNCS 788, Springer Verlag, pp. 241-256, April 1994. (Cited by 131)<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/pldi93.html Implementing Type Classes]<br />
:John Peterson and Mark P. Jones, In Proceedings of ACM SIGPLAN Symposium on Programming Language Design and Implementation, ACM SIGPLAN, June 1993. (Cited by 40)<br />
<br />
;[http://www.cs.chalmers.se/pub/cs-reports/papers/overload-fpca-93.ps.Z Implementing Haskell overloading]<br />
:Lennart Augustsson, 1993. FPCA. 65-73<br />
<br />
;[http://web.cecs.pdx.edu/~mpj/pubs/springschool.html Functional Programming with Overloading and Higher-Order Polymorphism]<br />
:Mark P. Jones, First International Spring School on Advanced Functional Programming Techniques, Baastad, Sweden, Springer-Verlag Lecture Notes in Computer Science 925, May 1995.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/type-class-design-space Type classes: exploring the design space]<br />
:Simon Peyton Jones, Mark Jones, Erik Meijer, Haskell Workshop 1997.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/fpca93.html A system of constructor classes: overloading and implicit higher-order polymorphism]<br />
:Mark P. Jones, In FPCA '93: Conference on Functional Programming Languages and Computer Architecture, Copenhagen, Denmark, June 1993.<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/overload2/overload2.ps.gz A second look at overloading]<br />
:Martin Odersky, Philip Wadler, Martin Wehr. 7'th International Conference on Functional Programming and Computer Architecture, ACM Press, San Diego, California, June 1995.<br />
<br />
;[http://citeseer.ist.psu.edu/laufer94combining.html Combining Type Classes and Existential Types]<br />
:Konstantin Laufer, Proceedings of the Latin American Informatic Conference (PANEL), 1994<br />
<br />
;[http://citeseer.ist.psu.edu/aufer95type.html Type Classes with Existential Types]<br />
:Konstantin Laufer, Journal of Functional Programming, 1996, May<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/DHCK06.html Modular Type Classes]<br />
:Derek Dreyer, Robert Harper, Manuel M.T. Chakravarty and Gabriele Keller, 2006<br />
<br />
;[http://www.informatik.uni-bonn.de/~ralf/hw2001/4.pdf Named instances for Haskell type classes]<br />
:W Kahl, J Scheffczyk - Proc. Haskell Workshop, 2001 (Cited by 12)<br />
<br />
===Deriving type classes===<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/derive.htm Derivable Type classes] <br />
:Ralf Hinze and Simon Peyton Jones, Haskell Workshop 2000.<br />
<br />
;[http://www.cis.upenn.edu/~sweirich/RepLib/ RepLib: A Library for Derivable Type Classes]<br />
:Stephanie Weirich 2006<br />
<br />
===Applications of type classes===<br />
<br />
;[http://okmij.org/ftp/Haskell/number-parameterized-types.html Number-parameterized types]<br />
:Oleg Kiselyov, The Monad.Reader. IssueFive. Oct 2nd, 2005<br />
<br />
;[http://web.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/typecase.pdf TypeCase: a design pattern for type-indexed functions]<br />
:Bruno C. d. S. Oliveira, Jeremy Gibbons. Proceedings of the 2005 ACM SIGPLAN workshop on Haskell. Tallinn, Estonia. 98 - 109, 2005 ISBN:1-59593-071-X<br />
<br />
;[http://okmij.org/ftp/Haskell/types.html#Prepose Functional pearl: implicit configurations--or, type classes reflect the values of types]<br />
:Oleg Kiselyov, Chung-chieh Shan, Proceedings of the 2004 ACM SIGPLAN workshop on Haskell, Snowbird, Utah, USA, 2004 ISBN 1-58113-850-4<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/extract-typeclassproofs.pdf Extracting Programs from Type Class Proofs]<br />
:Martin Sulzmann, 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/coind-type-class-proofs.ps Co-induction and Type Improvement in Type Class Proofs]<br />
:Martin Sulzmann, Jeremy Wazny and Peter J. Stuckey. 2005<br />
<br />
;[http://www.cs.nott.ac.uk/~ctm/faking.ps.gz Faking It (Simulating Dependent Types in Haskell)]<br />
:Conor McBride, Journal of Functional Programming, 12(4&5):375-392, July 2002<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/aophaskell.ps.gz Aspect-Oriented Programming with Type Classes]<br />
:Martin Sulzmann and Meng Wang, 2006.<br />
<br />
;[http://wwwtcs.inf.tu-dresden.de/~voigt/mpc08.pdf Asymptotic Improvement of Computations over Free Monads]<br />
:Janis Voigtländer. Mathematics of Program Construction (MPC'08), Proceedings, LNCS 5133:388-403, Springer-Verlag, 2008.<br />
<br />
<br />
==Undecidable instances==<br />
<br />
;[http://www.haskell.org/ghc/docs/6.4.2/html/users_guide/type-extensions.html#undecidable-instances Undecidable instances]<br />
:GHC User's Guide.<br />
<br />
==Multi-parameter type classes==<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/ghc-mptc-inf.ps Principal Type Inference for GHC-Style Multi-Parameter Type Classes]<br />
:Martin Sulzmann, Tom Schrijvers and Peter J. Stuckey. In APLAS'06.<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/mptc-inf-old.pdf Type Inference for Multi-Parameter Type Classes]<br />
:Martin Sulzmann and Peter J. Stuckey. 2005<br />
<br />
;[http://ostrich.lcs.mit.edu/cgi-bin/pickbib?jfp::DugganO2002 Type-checking multi-parameter type classes]<br />
:Dominic Duggan and John Ophel, Journal of Functional Programming, 12(2):133-158, March 2002<br />
<br />
==Functional dependencies==<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/fundeps.html Type Classes with Functional Dependencies]<br />
:Mark P. Jones, In Proceedings of the 9th European Symposium on Programming, ESOP 2000, Berlin, Germany, March 2000, Springer-Verlag LNCS 1782.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/fd-chr/index.htm Sound and Decidable Type Inference for Functional Dependencies]<br />
:Gregory J. Duck, Simon Peyton Jones, Peter J. Stuckey, and Martin Sulzmann, European Symposium on Programming 2004 (ESOP'04).<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/jfp-fds-revised.pdf Understanding Functional Dependencies via Constraint Handling Rules]<br />
:Martin Sulzmann, Gregory J. Duck, Simon Peyton-Jones and Peter J. Stuckey.j To appear in Journal of Functional Programming. 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/afds.ps Associated Functional Dependencies]<br />
:Martin Sulzmann and Edmund Soon Lee Lam. 2005<br />
<br />
==Constraint Handling Rules==<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/aplas06-invited.pdf Type Processing by Constraint Reasoning]<br />
:Peter J. Stuckey, Martin Sulzmann and Jeremy Wazny, In APLAS'06.<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/chr-stm.ps A Concurrent Constraint Handling Rules Implementation in Haskell with Software Transactional Memory]<br />
:Edmund S.L. Lam and Martin Sulzmann<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/chr06-observable.ps Observable Confluence for Constraint Handling Rules]<br />
:Gregory J. Duck, Peter J. Stuckey and Martin Sulzmann<br />
<br />
==Generalised Algebraic Data Types (GADTs)==<br />
<br />
;[http://research.microsoft.com/~simonpj/papers/gadt/index.htm Simple unification-based type inference for GADTs]<br />
:Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Geoffrey Washburn. Submitted to PLDI 2005<br />
<br />
;[http://www.cis.upenn.edu/~geoffw/research/papers/MS-CIS-05-26.pdf Wobbly types: type inference for generalised algebraic data types]<br />
:S Peyton Jones, G. Washburn, and S. Weirich. 2004.<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/simple-translate-gadts.ps Translating Generalized Algebraic Data Types to System F]<br />
:Martin Sulzmann and Meng Wang. 2005<br />
<br />
;[http://cristal.inria.fr/~fpottier/publis/pottier-regis-gianas-05.pdf Stratified type inference for generalized algebraic data types]<br />
:François Pottier and Yann Régis-Gianas, 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/gadt-short.ps Type Inference for GADTs via Herbrand Constraint Abduction]<br />
:Martin Sulzmann, Tom Schrijvers and Peter J. Stuckey, 2006 <br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/publications/tr-eadt.ps.gz A Framework for Extended Algebraic Data Types]<br />
:Martin Sulzmann, Jeremy Wazny and Peter J. Stuckey, 2006<br />
<br />
;[http://www.cs.kuleuven.be/~toms/Research/papers/implication_constraints.pdf Complete and Decidable Type Inference for GADTs]<br />
:Tom Schrijvers, Simon Peyton-Jones, Martin Sulzmann and Dimitrios Vytiniotis, 2009.<br />
<br />
;[http://web.cecs.pdx.edu/~cklin/pointwise/pointwise-tldi10.pdf Pointwise Generalized Algebraic Data Types]<br />
:Chuan-kai Lin and Tim Sheard, 2010.<br />
<br />
See also the [[GADT]] page.<br />
<br />
==Parametric Regular Data Types==<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/parametric-regular.ps Type Inference and Compilation for Parametric Regular Data Types]<br />
:Martin Sulzmann and Kenny Zhuo Ming Lu, 2006<br />
<br />
;[http://www.cs.mu.oz.au/~sulzmann/manuscript/haskell-xduce.ps The Marriage of Haskell and XDuce]<br />
:Martin Sulzmann and Kenny Zhuo Ming Lu<br />
<br />
==Type Families and Associated types==<br />
<br />
;[http://www.haskell.org/~simonmar/papers/assoc.pdf Associated types with class]<br />
:Manuel M. T. Chakravarty, Gabriele Keller, Simon Peyton Jones, Simon Marlow) POPL '05: Proceedings of the 32nd ACM SIGPLAN-SIGACT sysposium on Principles of programming languages, pages 1--13, Long Beach, California, USA, ACM Press, 2005<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/CKP05.html Associated Type Synonyms]<br />
:Manuel M. T. Chakravarty, Gabriele Keller, and Simon Peyton Jones. In Proceedings of The Tenth ACM SIGPLAN International Conference on Functional Programming, ACM Press, pages 241-253, 2005.<br />
<br />
;[http://www.informatik.uni-freiburg.de/~wehr/diplom ML Modules and Haskell Type Classes: A Constructive Comparison]<br />
:Stefan Wehr Diplomarbeit. Albert-Ludwigs-Universitt Freiburg, Fakultt fr Angewandte Wissenschaften, Institut fr Informatik, November 2005. <br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/SCP06.html System F with Type Equality Coercions]<br />
:Martin Sulzmann, Manuel M. T. Chakravarty, and Simon Peyton Jones.<br />
<br />
;[http://www.cs.kuleuven.be/~toms/Research/papers/type_functions.pdf Towards Open Type Functions for Haskell]<br />
:Tom Schrijvers, Simon Peyton Jones, Martin Sulzmann, and Manuel Chakravarty. In Proceedings of IFL' 07, Freiburg, Germany, 2007.<br />
<br />
;[http://www.cs.kuleuven.be/~toms/Research/papers/draft_type_functions_2008.pdf Type Checking with Open Type Functions for Haskell]<br />
:Tom Schrijvers, Simon Peyton Jones, Manuel Chakravarty, and Martin Sulzmann. In Proceedings of ICFP' 08, Victoria, Canada, 2008.<br />
<br />
<br />
==Arbitrary-rank polymorphism==<br />
<br />
;[http://www.ubka.uni-karlsruhe.de/vvv/1996/informatik/81/81.pdf.gz Putting type annotations to work]<br />
:Martin Odersky and Konstantin Läufer. Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages. St. Petersburg Beach, Florida, United States. 54 - 67 1996 ISBN 0-89791-769-3<br />
<br />
;[http://journals.cambridge.org/production/action/cjoGetFulltext%3Ffulltextid%3D445910 Practical type inference for arbitrary-rank types]<br />
:SP Jones, M Shields - Submitted to the Journal of Functional Programming, 2005<br />
<br />
==Phantom types==<br />
<br />
;[http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cis/TR2003-1901 First-class phantom types]<br />
:James Cheney and Ralf Hinze. Technical Report TR2003-1901, Cornell University, 2003.<br />
<br />
;[http://ttic.uchicago.edu/~fluet/research/phantom-subtyping/jfp06/jfp06.pdf Phantom Types and Subtyping]<br />
:Matthew Fluet and Riccardo Pucella. Submitted to the Journal of Functional Programming, 2006.<br />
<br />
==Implicit parameters==<br />
<br />
;[http://www.cse.ogi.edu/~mbs/pub/implicit_parameters/implicit.ps Implicit Parameters: Dynamic Scoping with Static Types]<br />
:Jeffrey Lewis, Mark Shields, Erik Meijer and John Launchbury. POPL'00. 2000.<br />
<br />
;[http://www.cs.chalmers.se/~rjmh/Globals.ps Global variables in Haskell]<br />
:John Hughes. J. Funct. Program. 14(5): 489-502 (2004) <br />
<br />
;[http://www.cs.uu.nl/pub/RUU/CS/techreps/CS-2004/2004-059.pdf Explicit Implicit Parameters]<br />
:A. Dijkstra and S. D. Swierstra. UU-CS 2004-059, 2004.<br />
<br />
==Object oriented Haskell==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/oo-haskell/index.htm Object-Oriented Style Overloading for Haskell] <br />
:Mark Shields and Simon Peyton Jones; BABEL workshop '01.<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/PC03.html Interfacing Haskell with Object-Oriented Languages]<br />
:Andr T. H. Pang and Manuel M. T. Chakravarty. In Greg Michaelson and Phil Trinder, editors, Implementation of Functional Languages: 15th International Workshop, IFL 2003, Edinburgh, UK, September 8-11, 2003, Revised Papers, LNCS 3145, Springer-Verlag, pages 20-36, 2004. <br />
<br />
;[http://citeseer.ist.psu.edu/118134.html Haskell++: An Object-Oriented Extension of Haskell]<br />
:Jan Sparud and John Hughes. Haskell Workshop 1995<br />
<br />
;[http://homepages.cwi.nl/~ralf/OOHaskell/ Haskell's overlooked object system]<br />
:Oleg Kiselyov and Ralf Lämmel, submitted for journal publication; online since 30 Sep. 2004;<br />
<br />
==Restricted Datatypes==<br />
<br />
;[http://www.cs.utexas.edu/users/ham/richards/FP%20papers/restricted-datatypes.pdf Restricted datatypes]<br />
:John Hughes. 1999 Haskell workshop<br />
<br />
==Patterns==<br />
<br />
;[http://www.cs.yale.edu/homes/tullsen/patterns.ps First Class Patterns]<br />
:Mark Tullsen. Practical Aspects of Declarative Languages, Second International Workshop, PADL 2000. volume 1753 of Lecture Notes in Computer Science. January 2000. <br />
<br />
===Pattern guards===<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/pat.htm Pattern Guards and Transformational Patterns]<br />
:Martin Erwig and Simon Peyton Jones; Haskell Workshop 2000.<br />
<br />
;[http://research.microsoft.com/Users/simonpj/Haskell/guards.html A new view of guards]<br />
:Simon Peyton Jones, April 1997<br />
<br />
===Views===<br />
<br />
;[http://www.haskell.org/development/views.html Views: An Extension to Haskell Pattern Matching]<br />
:Warren Burton, Erik Meijer, Patrick Sansom, Simon Thompson and Phil Wadler.<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/view/view.ps.gz Views: A way for pattern matching to cohabit with data abstraction]<br />
:POPL 14 (1987), 307-313.<br />
<br />
==Qualified types==<br />
<br />
;[http://haskell.readscheme.org/servlets/cite.ss?pattern=mpj-jones1994a Qualified Types: Theory and Practice]<br />
:Mark P. Jones. PhD. Thesis. Yale University. November 1994.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/fpca95.ps Simplifying and Improving Qualified Types]<br />
:Mark P. Jones. FPCA '95: Conference on Functional Programming Languages and Computer Architecture. June 1995.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/RR-1040.ps Simplifying and Improving Qualified Types]<br />
:Mark P. Jones. Yale University. Research Report YALEU/DCS/RR-1040. June 1994.<br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/RR-989.ps Coherence for qualified types]<br />
:Mark P. Jones. Yale University. Research Report YALEU/DCS/RR-989. September 1993. <br />
<br />
;[http://www.cse.ogi.edu/~mpj/pubs/rev-qual-types.ps A theory of qualified types]<br />
:Mark P. Jones. ESOP '92: European Symposium on Programming. Lecture Notes in Computer Science, 582. February 1992. (Cited by 68)<br />
<br />
==Polymorphic recursion==<br />
<br />
;[http://portal.acm.org/citation.cfm%3Fcoll%3DGUIDE%26dl%3DGUIDE%26id%3D169692 Type inference with polymorphic recursion]<br />
:F Henglein - ACM Transactions on Programming Languages and Systems (1993)<br />
<br />
;[http://www.jucs.org/jucs_9_8/practical_type_inference_for/paper.pdf Practical Type Inference for Polymorphic Recursion: an Implementation in Haskell]<br />
:C Vasconcellos, L Figueiredo, C Camarao - Journal of Universal Computer Science, 2003<br />
<br />
;[http://www.dcc.ufmg.br/~camarao/ml0-impl.ps Type Inference for Polymorphic Recursive Definitions: a Specification in Haskell]<br />
:L Figueiredo, C Camarao<br />
<br />
[[Category:Research]]<br />
[[Category:Type-level programming]]</div>Tomaxerhttps://wiki.haskell.org/index.php?title=Research_papers/Runtime_systems&diff=44537Research papers/Runtime systems2012-02-14T22:54:24Z<p>Tomaxer: Updated dead links</p>
<hr />
<div>__TOC__<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/spineless-tagless-gmachine.ps.gz Implementing lazy functional languages on stock hardware: the Spineless Tagless G-machine]<br />
:SL Peyton Jones, Journal of Functional Programming 2(2), Apr 1992, pp127-202. (Cited by 206)<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/eval-apply/index.htm How to make a fast curry: push/enter vs eval/apply]<br />
:Simon Marlow and Simon Peyton Jones, Proc International Conference on Functional Programming, Snowbird, Sept 2004, pp4-15. (Cited by 6)<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/new-rts.htm The New GHC/Hugs Runtime System]<br />
:Simon Marlow and Simon Peyton Jones. (Unpublished.) (Cited by 6)<br />
<br />
;[ftp://ftp.cs.chalmers.se/pub/cs-reports/papers/jfp-interactive.ps.Z The interactive Lazy ML System]<br />
:Lennart Augustsson, J. Funct. Program. 3(1): 77-92 (1993) (Cited by 3)<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/weak.htm Stretching the storage manager: weak pointers and stable names in Haskell]<br />
:Simon Peyton Jones, Simon Marlow, and Conal Elliott. Proc Workshop on Implementing Functional Languages, 1999.<br />
<br />
;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.411 Putting the Spine back in the Spineless Tagless G-machine: An Implementation of Resumable Blackholes]<br />
:A. Reid, In Proceedings of Implementation of Functional Languages (IFL98), Lecture Notes in Computer Science, volume 1595, pp 189-202, Springer Verlag, 1999. <br />
<br />
;[http://www.cs.bris.ac.uk/Publications/Papers/1000248.pdf The Brisk Machine: A Simplified STG Machine]<br />
:Ian Holyer and Eleni Spiliopoulou. University of Bristol. Technical Report CSTR-98-003. March 1998.<br />
<br />
;[http://www.cedar-forest.org/forest/events/festival/workshop1/spiliopoulou.ps The Brisk Machine: the Next Step in the Execution of Functional Languages]<br />
:Eleni Spiliopoulou. Proceedings of Festival Workshop in Foundations and Computations, FC'00. July 2000.<br />
<br />
;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.3918 The GRIN Project: A Highly Optimising Back End For Lazy Functional Languages]<br />
:Urban Boquist and Thomas Johnsson. 8th International Workshop on Implementation of Functional Languages. LNCS 1268. September 1996.<br />
<br />
;[http://www.cl.cam.ac.uk/~am21/papers/msp02.ps.gz The Cache Behaviour of Large Lazy Functional Programs on Stock Hardware]<br />
:Nicholas Nethercote, In Proceedings of the ACM SIGPLAN Workshop on Memory System Performance. 2003<br />
<br />
==Profiling==<br />
<br />
;[http://research.microsoft.com/apps/pubs/default.aspx?id=68455 Formally-based profiling for higher-order functional languages]<br />
:PM Sansom and SL Peyton Jones, ACM Transactions on Programming Languages and Systems, 19(2), March 1997, pp 334-385.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/profiling.ps.gz Time and space profiling for non-strict functional languages]<br />
:P Sansom and SL Peyton Jones, 22nd ACM Symposium on Principles of Programming Languages (POPL'95), San Francisco, Jan 1995, pp355-366.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/1994_nonstrict-profiling_THESIS.ps.gz Execution profiling for non-strict functional languages]<br />
:P Sansom, PhD thesis, University of Glasgow, Nov 1994.<br />
<br />
;[http://www.cs.york.ac.uk/ftpdir/reports/92/YCS/172/YCS-92-172.pdf Heap Profiling of Lazy Functional Programs]<br />
:Colin Runciman and David Wakeling. York University. YCS-92-172. 1992.<br />
<br />
;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.9361 New Dimensions in Heap Profiling]<br />
:Colin Runciman and Niklas Rojemo. York University. YCS-95-256. 1995.<br />
<br />
==Garbage collection==<br />
<br />
See also [[Research_papers/Parallelism_and_concurrency#Parallel_garbage_collection|parallel garbage collection]]<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/non-stop/index.htm Exploring the Barrier to Entry: Incremental Generational Garbage Collection for Haskell]<br />
:Andy Cheadle, Tony Field, Simon Marlow, Simon Peyton Jones, and Lyndon While, International Symposium on Memory Management, Vancouver, 2004.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/inc-gc.htm Non-stop Haskell]<br />
:Andy Cheadle, Tony Field, Simon Marlow, Simon Peyton Jones, and Lyndon While. ICFP 2000.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/gen-gc-for-haskell.ps.gz Generational garbage collection for Haskell]<br />
:P Sansom and SL Peyton Jones Proc Functional Programming Languages and Computer Architecture (FPCA'93), Copenhagen, June 1993, pp106-116.<br />
<br />
;[ftp://ftp.cs.york.ac.uk/pub/malcolm/rtgc.html An Incremental Garbage Collector for Embedded Real-Time Systems],<br />
:Malcolm Wallace and Colin Runciman. Proceedings of Chalmers Winter Meeting, June 1993.<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/leak/leak.ps.gz Fixing some space leaks with a garbage collector]<br />
:Philip Wadler. Software Practice and Experience, 17(9):595-608, September 1987.<br />
<br />
==Optimistic Evaluation==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/optimistic/index.htm Optimistic Evaluation: an adaptive evaluation strategy for non-strict programs]<br />
:Robert Ennals and Simon Peyton Jones, Proc ACM International Conference on Functional Programming, Uppsala, Aug 2003 (ICFP'03).<br />
<br />
;[http://portal.acm.org/citation.cfm?id=581694&dl=ACM&coll=portal&CFID=15151515&CFTOKEN=6184618 Eager Haskell: Resource-bounded Execution Yields Efficient Iteration]<br />
:Jan-Willem Maessen. Proceedings of the 2002 ACM SIGPLAN workshop on Haskell. Pittsburgh, Pennsylvania. 38 - 50. 2002 ISBN 1-58113-605-6<br />
<br />
;[http://www.it.kth.se/~kff/cheap.ps.gz Cheap Eagerness: Speculative Evaluation in a Lazy Functional Language]<br />
:Karl-Filip Faxn. ICFP 2000. September 2000.<br />
<br />
==Dynamic linking==<br />
<br />
;[http://www.cse.unsw.edu.au/~dons/papers/PSSC04.html Plugging Haskell In]<br />
:Andre Pang, Don Stewart, Sean Seefried, and Manuel M. T. Chakravarty. In Proceedings of the ACM SIGPLAN Workshop on Haskell, pages 10-21. ACM Press, 2004<br />
<br />
;[http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1406 Dynamic Applications From the Ground Up]<br />
:Don Stewart and Manuel M. T. Chakravarty. In Proceedings of the ACM SIGPLAN Workshop on Haskell, pages 27-38. ACM Press, 2005.<br />
<br />
==Loop detection==<br />
<br />
;[http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.2888 A Loop-detecting Interpreter for Lazy, Higher-order Programs]<br />
:Alex Ferguson and John Hughes. The 1992 Glasgow Workshop on Functional Programming. 85-101<br />
<br />
==Foreign language interfaces==<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/com.ps.gz Scripting COM components in Haskell]<br />
:SL Peyton Jones, E Meijer, and D Leijen, Software Reuse 1998.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/comserve.htm Calling hell from heaven and heaven from hell]<br />
:Sigbjorn Finne, Daan Leijen, Erik Meijer, and Simon Peyton Jones. ICFP '99.<br />
<br />
;[http://research.microsoft.com/~simonpj/Papers/green-card-1.ps.gz Green Card: a foreign-language interface for Haskell]<br />
:T Nordin and SL Peyton Jones, Proceedings of the Haskell Workshop, Amsterdam, June 1997.<br />
<br />
;[http://www.research.microsoft.com/users/simonpj/papers/comserve.ps.gz Calling heaven from hell, and hell from heaven]<br />
:Sigbjorn Finne, Daan Leijen, Erik Meijer and Simon Peyton Jones. ICFP'99<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/Cha99b.html C -> Haskell, or Yet Another Interfacing Tool]<br />
:Manuel M. T. Chakravarty. In Pieter Koopman and Chris Clack, editors, Implementation of Functional Languages, 11th. International Workshop (IFL'99), Springer-Verlag, LNCS 1868, 2000.<br />
<br />
;[http://research.microsoft.com/~emeijer/Papers/HDirect.pdf H/Direct: A Binary Foreign Language Interface for Haskell]<br />
:Sigbjorn Finne, Daan Leijen, Erik Meijer and Simon Peyton Jones. Presented at the International Conference on Functional Programming, Baltimore, M<br />
<br />
;[http://www.reid-consulting-uk.ltd.uk/alastair/publications/ifl03/index.html Template Greencard]<br />
:A. Reid. To be presented at IFL 2003, 15th International Workshop on the Implementation of Functional Languages, Edinburgh, Scotland, September 8-10, 2003.<br />
<br />
;[http://research.microsoft.com/~simonpj/papers/ptr-tag/index.htm Faster laziness using dynamic pointer tagging]<br />
:Simon Marlow, Alexey Rodriguez Yakushev, and Simon Peyton Jones. Submitted to ICFP 2007. <br />
<br />
[[Category:Research]]</div>Tomaxerhttps://wiki.haskell.org/index.php?title=Research_papers/Program_development&diff=44535Research papers/Program development2012-02-14T22:21:52Z<p>Tomaxer: Updated dead links</p>
<hr />
<div>__TOC__<br />
<br />
==Program derivation==<br />
<br />
;[http://www.cs.ox.ac.uk/ralf.hinze/publications/MPC04.pdf An algebra of scans]<br />
:Ralf Hinze. In Dexter Kozen, editor, Proceedings of the Seventh International Conference on Mathematics of Program Construction (MPC 2004), Stirling, Scotland, UK, July 12-14, 2004.<br />
<br />
;[http://www.cs.ox.ac.uk/ralf.hinze/publications/MPC02b.ps.gz Constructing tournament representations: An exercise in pointwise relational programming]<br />
:Ralf Hinze. In Eerke Boiten, Bernhard Mller, editors, Proceedings of the Sixth International Conference on Mathematics of Program Construction (MPC 2002), Dagstuhl, Germany, July 8-10, 2002. Lecture Notes in Computer Science 2386, pp. 131-147.<br />
<br />
==Editors==<br />
<br />
;[http://www.haskell.org/~simonmar/papers/vshaskell.pdf Visual Haskell: A full-featured Haskell development environment]<br />
:Krasimir Angelov, Simon Marlow. Haskell '05: Proceedings of the 2005 ACM SIGPLAN workshop on Haskell, pages 5--16, Tallinn, Estonia, ACM Press, September 2005<br />
<br />
;[http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1406 Dynamic Applications From the Ground Up]<br />
:Don Stewart and Manuel M. T. Chakravarty. In Proceedings of the ACM SIGPLAN Workshop on Haskell, pages 27-38. ACM Press, 2005.<br />
<br />
==Documentation==<br />
<br />
;[http://www.haskell.org/~simonmar/papers/haddock.pdf Haddock, A Haskell Documentation Tool]<br />
:Simon Marlow. Proceedings of the ACM SIGPLAN workshop on Haskell, Pittsburgh Pennsylvania, USA, ACM Press, October 2002<br />
<br />
==Refactoring==<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2001/1334/index.html Refactoring Functional Programs]<br />
:Simon Thompson and Claus Reinke. Technical Report 16-01, Computing Laboratory, University of Kent at Canterbury, October 2001.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2003/1676/index.html A case study in refactoring functional programs]<br />
:Simon Thompson and Claus Reinke. In Roberto Ierusalimschy, Lucilia Figueiredo, and Marcio Tulio Valente, editors, VII Brazilian Symposium on Programming Languages, pages 1-16. Sociedade Brasileira de Computacao, May 2003. <br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2003/1677/index.html Tool support for refactoring functional programs]<br />
:Huiqing Li, Claus Reinke, and Simon Thompson. In Johan Jeuring, editor, ACM SIGPLAN 2003 Haskell Workshop. Association for Computing Machinery, August 2003. ISBN 1-58113-758-3.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2004/2018/index.html Progress on HaRe: the Haskell Refactorer]<br />
:Huiqing Li, Claus Reinke, and Simon Thompson. Poster presentation at the International Conference on Functional Programming, Snowbird, Utah. ACM, September 2004.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2004/2021/index.html Transformation in HaRe]<br />
:Chau Nguyen-Viet. Technical report, Computing Laboratory, University of Kent, Canterbury, Kent, UK, December 2004.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2005/2158/index.html The Haskell Refactorer: HaRe, and its API]<br />
:Huiqing Li, Simon Thompson, and Claus Reinke. In John Boyland and Görel Hedin, editors, Proceedings of the 5th workshop on Language Descriptions, Tools and Applications (LDTA 2005), April 2005.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2005/2252/index.html Refactoring Functional Programs]<br />
:Simon Thompson. In Varmo Vene and Tarmo Uustalu, editors, Advanced Functional Programming, 5th International School, AFP 2004, volume 3622 of Lecture Notes in Computer Science, pages 331-357. Springer Verlag, September 2005. <br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2005/2266/index.html Porting HaRe to the GHC API]<br />
:Chris Ryder and Simon Thompson. Technical Report 8-05, Computing Laboratory, University of Kent, Canterbury, Kent, UK, October 2005.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2005/2250/index.html Formalisation of Haskell Refactorings]<br />
:Huiqing Li and Simon Thompson. In Marko van Eekelen and Kevin Hammond, editors, Trends in Functional Programming, September 2005.<br />
<br />
==Software metrics==<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2005/2249/index.html Software Metrics: Measuring Haskell]<br />
:Chris Ryder and Simon Thompson. In Marko van Eekelen and Kevin Hammond, editors, Trends in Functional Programming, September 2005.<br />
<br />
==Lexers and regular expressions==<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/Cha99.html Lazy Lexing is Fast]<br />
:Manuel M. T. Chakravarty. In A. Middeldorp and T. Sato, editors, Fourth Fuji International Symposium on Functional and Logic Programming, Springer-Verlag, LNCS 1722, pages 68-84, 1999.<br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2000/958/index.html Regular Expressions and Automata using Haskell]<br />
:Simon Thompson. Technical Report 5-00, Computing Laboratory, University of Kent, January 2000.<br />
<br />
==Parsers==<br />
<br />
;[http://legacy.cs.uu.nl/daan/download/papers/parsec-paper.pdf Parsec: Direct Style Monadic Parser Combinators for the Real World]<br />
:Daan Leijen and Erik Meijer. Technical Report UU-CS-2001-35, Departement of Computer Science, Universiteit Utrecht, 2001.<br />
<br />
;[http://www.cs.nott.ac.uk/~gmh/bib.html#monparsing Monadic Parser Combinators] <br />
:Graham Hutton and and Erik Meijer, Technical report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996. A condensed version of this report will appear as a functional pearl in JFP.<br />
<br />
;How to Replace Failure by a List of Successes<br />
:Philip Wadler, Functional Programming Languages and Computer Architecture, LNCS 201, 1985.<br />
<br />
;[http://www.st.cs.uni-saarland.de/edu/seminare/2005/advanced-fp/docs/hutton-parsing.pdf Higher-order functions for parsing]<br />
:Graham Hutton, J. Functional Programming 2(3):323-343, 1992.<br />
<br />
;[http://eprints.nottingham.ac.uk/archive/00000237/01/monparsing.pdf Monadic Parser Combinators] <br />
:Graham Hutton and Erik Meijer, Technical report NOTTCS-TR-96-4, Department of Computer Science, University of Nottingham, 1996.<br />
<br />
;[http://people.cs.uu.nl/jeroen/article/parsers/parsers.ps.gz Functional Parsers]<br />
:Jeroen Fokker, First International Spring School on Advanced Functional Programming Techniques, LNCS 925, 1995.<br />
<br />
;[http://journals.cambridge.org/action/displayJournal?jid=JFP Predictive parser combinators need four values to report errors]<br />
:Andrew Partridge and David Wright, J. Functional Programming 6(2): 355-364, 1996.<br />
<br />
;[http://journals.cambridge.org/action/displayJournal?jid=JFP Combinators for parsing expressions]<br />
:Steve Hill], J. Functional Programming 6(3):445-463, May 1996.<br />
<br />
;[http://www.staff.science.uu.nl/~swier101/Papers/1996/LL1.pdf Deterministic, Error-Correcting Combinator Parsers]<br />
:Doaitse Swierstra and Luc Duponcheel, Second International Summer School on Advanced Functional Programming Techniques, LNCS 1126, 1996.<br />
<br />
;[http://www.staff.science.uu.nl/~swier101/Papers/2000/HaskellWorkshop.pdf Combinator Parsers: From Toys to Tools]<br />
:D. Swierstra. Combinator Parsers: From Toys to Tools. In G. Hutton, editor, Electronic Notes in Theoretical Computer Science, volume 41. Elsevier Science Publishers, 2001.<br />
<br />
;[http://www.staff.science.uu.nl/~swier101/Papers/1999/SofSem99.pdf Fast, Error Correcting Parser Combinators: a Short Tutorial]<br />
:S. D. Swierstra and P. R. Azero Alcocer. In J. Pavelka, G. Tel, and M. Bartosek, editors, SOFSEM'99 Theory and Practice of Informatics, 26th Seminar on Current Trends in Theory and Practice of Informatics, volume 1725 of LNCS, pages 111--129, November 1999.<br />
<br />
==Pretty printing==<br />
<br />
;[http://www.cs.tufts.edu/~nr/comp150fp/archive/john-hughes/pretty.ps.gz The Design of a Pretty-printing Library]<br />
:John Hughes. Advanced Functional Programming 1995. 53-96<br />
<br />
;[http://homepages.inf.ed.ac.uk/wadler/papers/prettier/prettier.pdf A prettier printer]<br />
:Philip Wadler. The Fun of Programming. A symposium in honour of Professor Richard Bird's 60th birthday Examination Schools, Oxford, 24-25 March 2003.<br />
<br />
;[http://www.cs.uu.nl/research/techreps/repo/CS-2004/2004-025a.pdf Linear, Online, Functional Pretty Printing]<br />
:S. D. Swierstra. UU-CS 2004-025a, 2004.<br />
<br />
;[http://www.cs.uu.nl/groups/ST/Software/PP/pabloicfp.ps Optimal Pretty-Printing Combinators]<br />
:P. Azero and S. D. Swierstra. <br />
<br />
;[http://www.cs.kent.ac.uk/pubs/2006/2381/index.html Pretty printing with delimited continuations]<br />
:Olaf Chitil. Technical report 4-06, Computing Laboratory, University of Kent, June 2006.<br />
<br />
==User Interfaces==<br />
<br />
;[http://theses.gla.ac.uk/1597/ Composing graphical user interfaces in a purely functional language]<br />
:Sigbjorn Finne. PhD Thesis, Department of Computing Science, University of Glasgow, June 1998.<br />
<br />
;[http://research.microsoft.com/pubs/67057/composing-haggis.ps.gz Composing the User Interface with Haggis]<br />
:Sigbjorn Finne and Simon Peyton Jones Proceedings of the Second International School on Advanced Functional Programming, Olympia, WA, USA, August 26-30, 1996. LNCS 1129.<br />
<br />
;[http://thesoftwareinyourhead.com/papers/genuinely-functional-guis.pdf Genuinely Functional User Interfaces]<br />
:Antony Courtney and Conal Elliott. In Proceedings of the Haskell Workshop, September, 2001.<br />
<br />
;[http://legacy.cs.uu.nl/daan/download/papers/wxhaskell.pdf wxHaskell: A portable and concise GUI library for Haskell]<br />
:Daan Leijen. The ACM SIGPLAN Haskell workshop, Snowbird, Utah, September 22, 2004.<br />
<br />
==Operating systems==<br />
(see also main page of the topic: [[Libraries and tools/Operating system|operating systems and system programming]])<br />
<br />
;[http://www.cse.unsw.edu.au/~kleing/papers/hotos07.html Towards a Practical, Verified Kernel]<br />
:Kevin Elphinstone, Gerwin Klein, Philip Derrin, Timothy Roscoe, and Gernot Heiser . 2007<br />
<br />
;[http://www.cse.unsw.edu.au/~chak/papers/DEKC+06.html Reconciling High Performance and High Assurance in Microkernel Development]<br />
:Philip Derrin, Kevin Elphinstone, Gerwin Klein, David Cock, and Manuel M. T. Chakravarty. 2006<br />
<br />
;[http://web.cecs.pdx.edu/~apt/icfp05.pdf A Principled Approach to Operating System Construction in Haskell]<br />
:Thomas Hallgren, Mark P. Jones, Rebekah Leslie, Andrew Tolmach, ICFP 2005<br />
<br />
;[http://www.cse.unsw.edu.au/~kleing/papers/kolanski-klein-05.html Formalising the L4 microkernel API]<br />
:Rafal Kolanski and Gerwin Klein , 2006.<br />
<br />
;[http://www.doclsf.de/papers/vstte06.html Formalising a High-Performance Microkernel written in Haskell, using Isabelle/HOL]<br />
:Kevin Elphinstone, Gerwin Klein and Rafal Kolanski, 2006<br />
<br />
;[http://www.disy.cse.unsw.edu.au/theses_public/05/philipd.pdf A Secure Microkernel]<br />
:Philip Derrin, BSc (Hons) Thesis, University of NSW, 2005.<br />
<br />
:<br />
<br />
==Audio==<br />
<br />
;[http://dafx04.na.infn.it/WebProc/Proc/P_201.pdf Audio Processing using Haskell]<br />
:Henning Thielemann, Digital Audio Effects, DAF'04, Naples<br />
<br />
;[http://haskell.cs.yale.edu/?post_type=publication&p=255 A Model of Performance, Interaction, and Improvisation]<br />
:Paul Hudak and Jonathan Berger<br />
<br />
==Version Control==<br />
<br />
;[http://www.andres-loeh.de/VersionControl.html A Principled Approach to Version Control]<br />
:Andres Löh, Wouter Swierstra and Daan Leijen<br />
<br />
[[Category:Research]]</div>Tomaxerhttps://wiki.haskell.org/index.php?title=Research_papers/Authors&diff=39757Research papers/Authors2011-05-04T22:54:54Z<p>Tomaxer: Updated a few links</p>
<hr />
<div>__NOTOC__<br />
<br />
==A==<br />
*[http://www2.tcs.ifi.lmu.de/~abel/ Andres Abel]<br />
*[http://www.cs.nott.ac.uk/~txa/publ/ Thorsten Altenkirch]<br />
*[http://homepages.cwi.nl/~atanasso/pub Frank Atanassow]<br />
*[http://www.cs.chalmers.se/~augustss/ Lennart Augustsson]<br />
<br />
==B==<br />
*[http://www.cs.uu.nl/groups/ST/stbib/baars-by-year/baars-by-year-by-year.html Arthur Baars]<br />
*[http://web.comlab.ox.ac.uk/oucl/work/richard.bird/publications.html Richard Bird]<br />
*[http://www.cs.chalmers.se/~bjesse/ Per Bjesse]<br />
*[http://www.cs.chalmers.se/~boquist/ Urban Boquist]<br />
*[http://www.dcs.gla.ac.uk/~bunkenba/ Alex Bunkenburg]<br />
*[http://www.cs.sfu.ca/people/Faculty/Burton/publications.html F. Warren Burton]<br />
*[http://www.cs.st-andrews.ac.uk/~chrisb/ Christopher Brown]<br />
<br />
==C==<br />
*[http://www.cse.ogi.edu/~magnus/ Magnus Carlsson]<br />
*[http://www.cse.unsw.edu.au/~chak/papers/papers.html Manuel M. T. Chakravarty]<br />
*[http://www.cs.kent.ac.uk/people/staff/oc/pubs.html Olaf Chitil]<br />
*[http://www.iis.sinica.edu.tw/~trc/node2.html Tyng-Ruey Chuang]<br />
*[http://www.cs.chalmers.se/~koen/pubs/ Koen Claessen]<br />
*[http://www.dcs.gla.ac.uk/~grmc/ Graham Collins]<br />
*[http://www.irisa.fr/EXTERNE/projet/lande/consel/consel.html Charles Consel]<br />
*[http://www.apocalypse.org/pub/u/antony/work/index.html Antony Courtney]<br />
<br />
==D==<br />
*[http://www.c3.lanl.gov/~kei/publications.html Kei Davis]<br />
*[http://www.cse.ogi.edu/~diatchki/papers/ Iavor Diatchki]<br />
<br />
==E==<br />
*[http://conal.net/papers/ Conal Elliott]<br />
*[http://www.cambridge.intel-research.net/~rennals/ Robert Ennals]<br />
*[http://web.engr.oregonstate.edu/~erwig/papers/ Martin Erwig]<br />
<br />
==F==<br />
*[http://web.it.kth.se/~kff/publications.html Karl-Filip Fax&eacute;n]<br />
*[http://yeats.ucc.ie/~abf/ Alex Ferguson]<br />
*[http://www.galois.com/~sof/pubs.html Sigbjorn Finne]<br />
*[http://www.cs.uu.nl/people/jeroen/ Jeroen Fokker]<br />
<br />
==G==<br />
*[http://web.comlab.ox.ac.uk/oucl/work/jeremy.gibbons/publications/ Jeremy Gibbons]<br />
*[http://www.monadgarden.com/andy/ Andy Gill]<br />
*[http://www.dcs.gla.ac.uk/~joy/ Joy Goodman]<br />
*[http://research.microsoft.com/~adg/ Andrew D. Gordon]<br />
*Louis-Julien Guillemette<br />
*[http://www.cs.chalmers.se/~gustavss/ J&ouml;rgen Gustavsson]<br />
<br />
==H==<br />
*[http://www.dcs.gla.ac.uk/~cvh/ Cordelia Hall]<br />
*[http://www.cse.ogi.edu/~hallgren/ Thomas Hallgren]<br />
*[http://www-fp.dcs.st-and.ac.uk/~kh/papers/ABSTRACTS.html Kevin Hammond]<br />
*[http://research.microsoft.com/~tharris/ Tim Harris]<br />
*[http://www.cs.uu.nl/~bastiaan/ Bastiaan Heeren]<br />
*[http://www.cs.chalmers.se/~heldal/ Rogardt Heldal]<br />
*[http://www.cs.unc.edu/~heringto/ Dean Herington]<br />
*[http://www.infosun.fmi.uni-passau.de/cl/staff/herrmann/index.html Christoph A. Herrmann]<br />
*[http://www.informatik.uni-bonn.de/~ralf/publications/ Ralf Hinze]<br />
*[http://www.cs.uu.nl/people/stefan Stefan Holdermans]<br />
*[http://www.cse.ogi.edu/~hook/new/Default.htm James Hook]<br />
*[http://www.ipl.t.u-tokyo.ac.jp/~hu/pub/tech.html Zhenjiang Hu]<br />
*[http://cs-www.cs.yale.edu/homes/hudak.html Paul Hudak]<br />
*[http://www.cs.chalmers.se/~rjmh/pubs.htm John Hughes]<br />
*[http://www.cs.nott.ac.uk/~gmh/ Graham Hutton]<br />
<br />
==I==<br />
*[http://www.cs.nott.ac.uk/Department/Staff/gmh/bib.html Graham Hutton]<br />
*[http://www.cs.uu.nl/groups/ST/stbib/ijzendoorn-by-year/ijzendoorn-by-year-by-year.html Arjan van IJzendoorn]<br />
*[http://www.cs.chalmers.se/~indrika/ Mia Indrika]<br />
<br />
==J==<br />
*[http://www.cs.chalmers.se/~patrikj/ Patrik Jansson]<br />
*[http://www.cs.uu.nl/groups/ST/stbib/jeuring-by-year/jeuring-by-year-by-year.html Johan Jeuring]<br />
*[http://crab.rutgers.edu/~pjohann/vita.html Patricia Johann]<br />
*[http://www.cs.chalmers.se/~bengtj/ Bengt Johansson]<br />
*[http://www.cs.chalmers.se/~johnsson Thomas Johnsson]<br />
*[http://web.cecs.pdx.edu/~mpj/pubs.html Mark P. Jones]<br />
*[http://www.cs.stir.ac.uk/~sbj/ Simon B. Jones]<br />
*[http://research.microsoft.com/Users/simonpj Simon Peyton Jones]<br />
*[http://www.syntaxpolice.org/ Isaac Jones]<br />
<br />
==K==<br />
*[http://users.info.unicaen.fr/~karczma Jerzy Karczmarczuk]<br />
*[http://www.cse.unsw.edu.au/~keller/#publications Gabriele Keller]<br />
*[http://okmij.org/ftp/ Oleg Kiselyov]<br />
*[http://www.cse.ogi.edu/~krstic/ Sava Krstic]<br />
<br />
==L==<br />
*[http://lsi.uniovi.es/~labra Jose E. Labra]<br />
*[http://homepages.cwi.nl/~ralf/publications.html Ralf Lämmel]<br />
*[http://www.cse.ogi.edu/~jl John Launchbury]<br />
*[http://www.cs.uu.nl/~daan/pubs.html Daan Leijen]<br />
*[http://www.cse.ogi.edu/~jlewis Jeff Lewis]<br />
*[http://www.seas.upenn.edu/~lipeng/homepage/ Peng Li]<br />
*[http://java.sun.com/people/sl/ Sheng Liang]<br />
*[http://www.iai.uni-bonn.de/~loeh Andres L&ouml;h]<br />
*[http://www.dcs.gla.ac.uk/~hwloidl/ Hans-Wolfgang Loidl]<br />
*[http://www.mathematik.uni-marburg.de/~loogen Rita Loogen]<br />
*[http://www.frogsonice.com/work.html Sandra J. Loosemore]<br />
*[http://web.comlab.ox.ac.uk/oucl/work/ian.lynagh/papers/ Ian Lynagh]<br />
<br />
==M==<br />
*[http://www.haskell.org/~simonmar/bib/bib.html Simon Marlow] <br />
*[http://personal.cis.strath.ac.uk/~conor/pub/ Conor McBride]<br />
*[http://www.dcs.st-andrews.ac.uk/~james/ James McKinna]<br />
*[http://www.kestrel.edu/home/people/meertens/ Lambert Meertens]<br />
*[http://research.microsoft.com/~emeijer/ Eric Meijer]<br />
*[http://www.engr.uconn.edu/~jeffm/ Jeff Meunier]<br />
*[http://www-users.cs.york.ac.uk/~ndm/downloads.php Neil Mitchell]<br />
*[http://www.disi.unige.it/person/MoggiE/publications.html Eugenio Moggi]<br />
*Andrew Moran<br />
*Stefan Monnier<br />
<br />
==N==<br />
*[http://cs-www.cs.yale.edu/homes/nilsson/papers.html Henrik Nilsson]<br />
*[http://www.cse.ogi.edu/~nordin Thomas Nordin]<br />
*[http://www.cse.ogi.edu/~nordland/ Johan Nordlander]<br />
<br />
==O==<br />
*[http://lampwww.epfl.ch/~odersky/papers/ Martin Odersky]<br />
*[http://www.dcs.gla.ac.uk/~jtod/ John O'Donnell]<br />
*[http://www.eecs.usma.edu/Personnel/okasaki Chris Okasaki]<br />
*[http://www.ipl.t.u-tokyo.ac.jp/~onoue/ Yoshiyuki Onoue]<br />
<br />
==P==<br />
*[http://www.cs.chalmers.se/~pareto/ Lars Pareto]<br />
*[http://www.dcs.gla.ac.uk/~partain/ Will Partain]<br />
*[http://www.soi.city.ac.uk/~ross/papers/ Ross Paterson]<br />
*[[User:John Peterson|John Peterson]]<br />
*[http://research.microsoft.com/Users/simonpj Simon Peyton Jones]<br />
*[http://www.cs.mu.oz.au/~bjpop/papers.html Bernie Pope]<br />
*[http://www.mathematik.uni-marburg.de/~priebe Steffen Priebe]<br />
*[http://ad-astra.ro/Ha$kell Popa Dan <br> Public e-mail: popavdan@yahoo.com]<br />
<br />
==Q==<br />
<br />
==R==<br />
*[http://www.reid-consulting-uk.ltd.uk/alastair/ Alastair Reid]<br />
*[http://www.dcs.gla.ac.uk/~reidrm/ Richard Reid]<br />
*[http://www.dcs.gla.ac.uk/~reig/ Fermin Reig]<br />
*[http://www-users.cs.york.ac.uk/~colin/ Colin Runciman]<br />
<br />
==S==<br />
*[http://www.cs.chalmers.se/~andrei/ Andrei Sabelfeld]<br />
*[http://www.dcs.gla.ac.uk/~meurig/ Meurig Sage]<br />
*[http://www.cs.chalmers.se/~dave/ David Sands]<br />
*[http://www.dcs.gla.ac.uk/~sansom/ Patrick Sansom]<br />
*[http://www.di.ufpe.br/~alms/ Andr&eacute; Santos]<br />
*[http://users.ugent.be/~tschrijv/ Tom Schrijvers]<br />
*[http://www.cse.unsw.edu.au/~sseefried/papers/papers.html Sean Seefried]<br />
*[http://web.cecs.pdx.edu/~sheard/papers/ Tim Sheard]<br />
*[http://www.cs.chalmers.se/~ms/ Mary Sheeran]<br />
*[http://www.cse.ogi.edu/~mbs/ Mark Shields]<br />
*[http://www.dis.strath.ac.uk/people/sinclair/ Duncan Sinclair]<br />
*[http://research.microsoft.com/en-us/people/satnams/ Satnam Singh]<br />
*[http://www.cs.chalmers.se/~sparud/ Jan Sparud]<br />
*[http://www.cs.bris.ac.uk/~spilio/ Eleni Spiliopoulou]<br />
*[http://www.cse.unsw.edu.au/~dons/papers.html Don Stewart]<br />
*[http://ww2.cs.mu.oz.au/~sulzmann/ Martin Sulzmann]<br />
*[http://www.cse.chalmers.se/~josefs/ Josef Svenningsson]<br />
*[http://www.cs.uu.nl/groups/ST/stbib/swierstra-by-year/swierstra-by-year-by-year.html Doaitse Swierstra]<br />
<br />
==T==<br />
*[http://www.cs.chalmers.se/~makoto Makoto Takeyama]<br />
*[http://www.henning-thielemann.de/ResearchE.html Henning Thielemann]<br />
*[http://www.cs.kent.ac.uk/people/staff/sjt/pubs.html Simon Thompson]<br />
*[http://www.cs.york.ac.uk/~mjt/ Michael Thyer]<br />
*[http://www.macs.hw.ac.uk/~trinder/publications.html Paul Trinder]<br />
*[http://www.cs.yale.edu/homes/tullsen/publications.html Mark Tullsen]<br />
<br />
==U==<br />
<br />
* [http://www.cs.ioc.ee/~tarmo/papers/ Tarmo Uustalu]<br />
<br />
==V==<br />
* [http://www.cs.ru.nl/A.vanWeelden/index.php?p=publications Arjen van Weelden]<br />
* [http://www.cs.ut.ee/~varmo/papers/index.html Varmo Vene]<br />
* [http://www.iai.uni-bonn.de/~jv/ Janis Voigtländer]<br />
<br />
==W==<br />
*[http://homepages.inf.ed.ac.uk/wadler/ Philip Wadler]<br />
*[http://www.imn.htwk-leipzig.de/~waldmann/ Johannes Waldmann]<br />
*[ftp://ftp.cs.york.ac.uk/pub/malcolm/ Malcolm Wallace]<br />
*[http://www.lochan.org/keith/publications/index.html Keith Wansbrough]<br />
*[http://www.cis.upenn.edu/~geoffw/research/index.html Geoff Washburn]<br />
*[http://www.seas.upenn.edu/%7Esweirich/publications.html Stephanie Weirich]<br />
*[http://www.informatik.uni-freiburg.de/~wehr/#Publications Stefan Wehr]<br />
*[http://www.lotus.com/lotus/research.nsf/grouppage?Openpage Eric Wilcox]<br />
*[http://www.dcs.gla.ac.uk/~nww/ Noel Winstanley]<br />
<br />
==X==<br />
*[http://www.cl.cam.ac.uk/~nx200/ Dana Xu]<br />
<br />
==Y==<br />
<br />
==Z==<br />
<br />
<i>Authors, please add yourself! :)</i></div>Tomaxer