@STRING{j_hosc			= "Higher-Order and Symbolic Computation" }
@STRING{j_jfp			= "Journal of Functional Programming" }
@STRING{j_nature		= "Nature" }
@STRING{proc_popl_1		= "{POPL} '" }
@STRING{proc_popl_2		= ": Conference Record of the Annual {ACM} Symposium on Principles of Programming Languages" }
@STRING{proc_icfp_1		= "{ICFP} '" }
@STRING{proc_icfp_2		= ": Proc. {ACM} International Conference on Functional Programming" }
@STRING{pub_acm			= "{ACM} {P}ress" }
@STRING{pub_acm_addr		= "{N}ew {Y}ork" }
@STRING{pub_ap			= "Academic Press" }
@STRING{pub_ap_addr		= "San Diego, CA" }
@STRING{pub_cambridge		= "Cambridge University Press" }
@STRING{pub_cambridge_addr	= "Cambridge" }
@STRING{pub_sv			= "Springer" }
@STRING{pub_sv_addr		= "Berlin" }
@STRING{s_lncs			= "{L}ecture {N}otes in {C}omputer {S}cience" }
@STRING{s_entcs			= "Electronic Notes in Theoretical Computer Science" }
@STRING{techreport		= "Tech.\ Rep." }

@article{jones:fundeps2,
  author = "Mark Jones",
  title = "Languages and program design for functional dependencies",
  crossref = "haskell2008",
  pages = "87-98"
}

@Article{sheard:future,
  author =	"Tim Sheard",
  title =	"Languages of the Future",
  journal =	"Onward Track, OOPSLA'04. Reprinted in: ACM SIG{\-}PLAN Notices, Dec. 2004.",
  pages    = {116--119},
  volume =	"39",
  year = 	"2004",
  note     = {OOPSLA Companion Volume},
}

@inproceedings{sheard:meta-prog-omega,
  title = "Meta-programming with built-in type equality",
  author = "Tim Sheard and Emir Pasalic",
  booktitle = "Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-languages ({LFM}'04)",
  location = "Cork",
  month = jul,
  year = 2004,
  keywords = "phantom types, type indexed data types"
}

@InProceedings{sheard:generic-prog-omega,
  title =       "Generic Programming Programming in {Omega}",
  author =      "Tim Sheard",
  publisher =   "Springer",
  year =        "2006",
  volume =      "4719",
  booktitle =   "Datatype-Generic Programming",

  editor =      "Roland Backhouse and Jeremy Gibbons and Ralf Hinze and Johan Jeuring",
  ISBN =        "978-3-540-76785-5",
  pages =       "258--284",
  series =      "Lecture Notes in Computer Science",
}
@InProceedings{sheard:programming-omega,
  title =       "Programming in {Omega}",
  author =      "Tim Sheard and Nathan Linger",
  publisher =   "Springer",
  year =        "2007",
  volume =      "5161",
  bibdate =     "2008-10-23",
  bibsource =   "DBLP,
                 http://dblp.uni-trier.de/db/conf/cefp/cefp2007.html#SheardL07",
  booktitle =   "{2nd Central European Functional Programming School}",
  editor =      "Zolt{\'a}n Horv{\'a}th and Rinus Plasmeijer and Anna
                 So{\'o}s and Vikt{\'o}ria Zs{\'o}k",
  ISBN =        "978-3-540-88058-5",
  pages =       "158--227",
  series =      "Lecture Notes in Computer Science",
  URL =         "http://dx.doi.org/10.1007/978-3-540-88059-2_5",
}
@InProceedings{	atkey-parameterised,
  author	= "Robert Atkey",
  title		= "Parameterised Notions of Computation",
  crossref	= "msfp2006",
  url		= "http://homepages.inf.ed.ac.uk/ratkey/param-notions.pdf"
}

@book{siek-etal:boost,
  author = "Jeremy Siek and Lie-Quan Lee and Andrew Lumsdaine",
  title = "The {Boost Graph Library User Guide and Reference Manual}",
  publisher = "Addison-Wesley",
  year = 2001
}

@inproceedings{pucella-tov:session-types,
  title = "Haskell Session Types with (Almost) No Class",
  author = "Riccardo Pucella and Jesse Tov",
  crossref = "haskell2008",
  pages = "25--36"
}

@unpublished{kiselov:printf-gadt,
  title = "Formatted {IO} as an embedded {DSL}: the initial view",
  author = "Oleg Kiselyov",
  note = "\url{http://okmij.org/ftp/typed-formatting/#DSL-In}",
  year = 2008
}

@unpublished{chakravarty:indexed-families,
  title = "Type families",
  author = "Manuel Chakravarty",
  note = "\url{http://haskell.org/haskellwiki/GHC/Indexed_types}",
  year = 2008
}

@techreport{asai:printf,
  title = "On typing delimited continuations: three new solutions to the printf problem",
  author = "Kenichi Asai",
  note = "\url{http://pllab.is.ocha.ac.jp/~asai/papers/tr07-1.ps.gz}",
  school = "Ochanomizu University Technical Report",
  number = "OCHA-IS 08-2", 
  month = sep, year = 2008
}

@unpublished{sackman:session-types,
  title = "A tutorial for session types",
  author = "Matthew Sackman",
  note = "\url{http://www.wellquite.org/sessions/tutorial_1.html}",
  year = 2008
}


@InProceedings{imai-session,
  title="A full implementation of Session Types in Haskell",
  author="Keigo Imai and Shoji Yuen and Kiyoshi Agusa",
  booktitle="{PPL2009}: 11th Programming and Programming languages workshop",
  year="2009",
  month=mar,
  location="Takayamashi, Gifuken, Japan",
  note="\url{http://www.agusa.i.is.nagoya-u.ac.jp/person/sydney/fullsession-ppl2009/20090224/imai-ppl2009-submitted1.pdf}",
  slides="\url{http://www.agusa.i.is.nagoya-u.ac.jp/person/sydney/fullsession-ppl2009/20090310/ppl2009-imai-final.pdf}",
}


@unpublished{ingram:session-types,
  title = "Fun with type functions",
  author = "Ryan Ingram",
  note = "\url{http://www.haskell.org/pipermail/haskell-cafe/2008-November/051108.html}",
  year = 2008
}

@unpublished{hutton:paramorphism,
  author = "Toby Hutton",
  title = "Fun with type functions",
  note = "\url{http://www.haskell.org/pipermail/haskell-cafe/2008-November/051105.html}",
  month = nov,
  year = 2008
}

@unpublished{elliott:memo-functions,
  author = "Conal Elliott",
  title = "Elegant memoization with functional memo tries",
  note = "\url{http://conal.net/blog/posts/elegant-memoization-with-functional-memo-tries}",
  year = 2008
}

@incollection{hinze:fun,
  author = "Ralf Hinze",
  title = "Fun with phantom types",
  booktitle = "The Fun of Programming",
  editor = "Jeremy Gibbons and Oege de Moor",
  publisher = "Palgrave",
  year = 2003,
  pages = {245--262}
}
  
@article{fluet:phantom,
  author	= "Matthew Fluet and Riccardo Pucella",
  title		= "Phantom Types and Subtyping",
  journal	= j_jfp,
  year		= 2006,
  volume	= 16,
  number	= 6,
  pages		= "751--791",
  url		= "http://arxiv.org/abs/cs.PL/0403034",
  abstract	= "We investigate a technique from the literature, called the phantom-types technique, that uses parametric polymorphism, type constraints, and unification of polymorphic types to model a subtyping hierarchy. Hindley-Milner
		  type systems, such as the one found in Standard ML, can be used to enforce the subtyping relation, at least for first-order values. We show that this technique can be used to encode any finite subtyping hierarchy
		  (including hierarchies arising from multiple interface inheritance). We formally demonstrate the suitability of the phantom-types technique for capturing first-order subtyping by exhibiting a type-preserving translation
		  from a simple calculus with bounded polymorphism to a calculus embodying the type system of SML."
}

@inproceedings{guillemette-monnier:cps,
  author = "Louis-Julien Guillemette and Stefan Monnier",
  title = "A type-preserving compiler in {H}askell",
  crossref = "icfp2008",
  pages = "75--90"
}

@InProceedings{fluet:datatype-spec,
  author	= "Matthew Fluet and Riccardo Pucella",
  title		= "Practical Datatype Specializations with Phantom Types and Recursion Schemes",
  crossref	= "ml2005",
  url		= "http://arxiv.org/abs/cs/0510074",
  abstract	= "Datatype specialization is a form of subtyping that captures program invariants on data structures that are expressed using the convenient and intuitive datatype notation. Of particular interest are structural invariants
		  such as well-formedness. We investigate the use of phantom types for describing datatype specializations. We show that it is possible to express statically-checked specializations within the type system of Standard ML. We
		  also show that this can be done in a way that does not lose useful programming facilities such as pattern matching in case expressions."
}


@InProceedings{pj+:simple-gadt, 
  author	= "Peyton Jones, Simon L. and Dimitrios Vytiniotis and Stephanie Weirich and Geoffrey Alan Washburn",
  title		= "Simple Unification-Based Type Inference for {GADT}s",
  pages		= "50--61",
  crossref	= "icfp2006",
  url		= "http://research.microsoft.com/~simonpj/papers/gadt/",
  abstract	= "Generalized algebraic data types (GADTs), sometimes known as ``guarded recursive data types'' or ``first-class phantom types'', are a simple but powerful generalization of the data types of Haskell and ML. Recent works
		  have given compelling examples of the utility of GADTs, although type inference is known to be difficult. Our contribution is to show how to exploit programmer-supplied type annotations to make the type inference task
		  almost embarrassingly easy. Our main technical innovation is \emph{wobbly types}, which express in a declarative way the uncertainty caused by the incremental nature of typical type-inference algorithms."
}

@Article{garcia-etal:comp-generic,
  author	= "Ronald Garcia and Jaakko Jarvi and Andrew Lumsdaine and Jeremy Siek and Jeremiah Willcock",
  title		= {An Extended Comparative Study of Language Support for Generic Programming},
  journal	= j_jfp,
  year		= 2007,
  month		= mar,
  volume	= 17,
  number	= 2,
  pages		= "145--205",
  annote	= "Journal version of \cite{garcia-comparative}",
  abstract	= {Many modern programming languages support basic generics, sufficient to implement type-safe polymorphic containers. Some languages have moved beyond this basic support, and in doing so have enabled a broader, more
		  powerful form of generic programming. This paper reports on a comprehensive comparison of facilities for generic programming in eight programming languages: C++, Standard ML, Objective Caml, Haskell, Eiffel, Java, C# (with
		  its proposed generics extension), and Cecil. By implementing a substantial example in each of these languages, we illustrate how the basic roles of generic programming can be represented in each language. We also identify
		  eight language properties that support this broader view of generic programming: support for multi-type concepts, multiple constraints on type parameters, convenient associated type access, constraints on associated types,
		  retroactive modeling, type aliases, separate compilation of algorithms and data structures, and implicit argument type deduction for generic algorithms. We find that these features are necessary to avoid awkward designs,
		  poor maintainability, and painfully verbose code. As languages increasingly support generics, it is important that language designers understand the features necessary to enable the effective use of generics and that their
		  absence can cause difficulties for programmers.}
}

@Article{	carette-finally-jfp,
  author	= "Jacques Carette and Oleg Kiselyov and Shan, Chung-chieh",
  title		= "Finally Tagless, Partially Evaluated: Tagless Staged Interpreters for Simpler Typed Languages",
  journal	= j_jfp,
  year		= 2008,
  note		= "In press"
}

@inproceedings{schrijvers-et-al:open-type-functions,
  title =  "Type Checking with Open Type Functions",
  author = "Tom Schrijvers and Simon Peyton~Jones and 
	   Manuel Chakravarty and Martin Sulzmann",
  crossref = "icfp2008",
  pages = "51--62"
}

@InProceedings{chakravarty:assoc-data,
  author	= {Manuel M. T. Chakravarty and Gabriele Keller and Peyton Jones, Simon L. and Simon Marlow},
  title		= {Associated Types with Class},
  pages		= {1--13},
  crossref	= "popl2005",
  abstract	= "Haskell's type classes allow ad-hoc overloading, or type-indexing, of \emph{functions}. A natural generalisation is to allow type-indexing of \emph{data types} as well. It turns out that this idea directly supports a
		  powerful form of abstraction called \emph{associated types}, which are available in C++ using traits classes. Associated types are useful in many applications, especially for self-optimising libraries that adapt their data
		  representations and algorithms in a type-directed manner.\par In this paper, we introduce and motivate associated types as a rather natural generalisation of Haskell's existing type classes. Formally, we present a type
		  system that includes a type-directed translation into an explicitly typed target language akin to System F; the existence of this translation ensures that the addition of associated data types to an existing Haskell
		  compiler only requires changes to the front end."
}

@InProceedings{chakravarty-synonyms,
  author	= {Manuel M. T. Chakravarty and Gabriele Keller and Peyton Jones, Simon L.},
  title		= {Associated Type Synonyms},
  pages		= {241--253},
  crossref	= "icfp2005",
  abstract	= "Haskell programmers often use a multi-parameter type class in which one or more type parameters are functionally dependent on the first. Although such functional dependencies have proved quite popular in practice, they
		  express the programmer's intent somewhat indirectly. Developing earlier work on \emph{associated data types}, we propose to add functionally dependent types as type synonyms to type-class bodies. These \emph{associated
		  type synonyms} constitute an interesting new alternative to explicit functional dependencies."
}

@Article{	danvy-unparsing,
  author	= "Olivier Danvy",
  title		= "Functional Unparsing",
  journal	= j_jfp,
  year		= 1998,
  month		= nov,
  volume	= 8,
  number	= 6,
  pages		= "621--625"
}

@InProceedings{	danvy-defunctionalization,
  author	= "Danvy, Olivier and Nielsen, Lasse R.",
  title		= "Defunctionalization at Work",
  pages		= "162--174",
  crossref	= "ppdp2001"
}

@InProceedings{	diatchki-strongly,
  author	= "Iavor S. Diatchki and Mark P. Jones",
  title		= "Strongly Typed Memory Areas: Programming Systems-Level Data Structures in a Functional Language",
  crossref	= "haskell2006",
  url		= "http://www.cse.ogi.edu/~diatchki/papers/"
}

@inproceedings{hinze-etal:tidata,
  author = "Ralf Hinze and Johan Jeuring and Andres L{\"o}h",
  title = "Type-indexed data types",
  editors = "Eerke Boiten and Bernhard M{\"o}ller",
  booktitle = "{Proceedings of the Sixth International Conference on Mathematics of Program Construction (MPC 2002)}", 
  number = 2386,
  series = s_lncs,
  publisher = "Springer Verlag",
  pages = "148--174", year = 2002
}

@Article{	hinze-generalizing,
  author	= "Ralf Hinze",
  title		= "Generalizing Generalized Tries",
  journal	= j_jfp,
  year		= 2000,
  month		= jul,
  volume	= 10,
  number	= 4,
  pages		= "327--351"
}

@Article{	hinze-formatting,
  author	= "Ralf Hinze",
  title		= "Formatting: A Class Act",
  journal	= j_jfp,
  year		= 2003,
  month		= sep,
  volume	= 13,
  number	= 5,
  pages		= "935--944"
}

@InCollection{	jones-functional,
  author	= "Mark P. Jones",
  title		= "Functional Programming with Overloading and Higher-Order Polymorphism",
  pages		= "97--136",
  crossref	= "afp1995",
  url		= "http://web.cecs.pdx.edu/~mpj/pubs/springschool.html"
}

@InProceedings{	jones-type,
  author	= "Mark P. Jones",
  title		= "Type Classes with Functional Dependencies",
  pages		= "230--244",
  crossref	= "esop2000",
  url		= "http://www.cse.ogi.edu/~mpj/pubs/fundeps.html http://www.cse.ogi.edu/~mpj/pubs/fundeps-esop2000.pdf"
}

@InProceedings{	kiselyov-resources,
  author	= "Oleg Kiselyov and Shan, Chung-chieh",
  title		= "Lightweight Static Resources: Sexy Types for Embedded and Systems Programming",
  crossref	= "tfp2007-draft"
}

@Article{	michie-memo,
  author	= "Donald Michie",
  title		= {``{M}emo'' Functions and Machine Learning},
  journal	= j_nature,
  year		= 1968,
  month		= "6~"  # apr,
  volume	= 218,
  pages		= "19--22"
}

@InProceedings{	neubauer-implementation,
  author	= {Matthias Neubauer and Peter Thiemann},
  title		= {An Implementation of Session Types},
  pages		= {56--70},
  crossref	= {padl2004},
  url		= "http://www.informatik.uni-freiburg.de/~neubauer/papers/padl04.ps.gz http://www.informatik.uni-freiburg.de/~neubauer/papers/padl04.pdf"
}

@InProceedings{	reynolds-definitional-notes,
  author	= "John C. Reynolds",
  title		= "Definitional Interpreters for Higher-Order Programming Languages",
  pages		= "717--740",
  crossref	= "acm1972",
  note		= "Reprinted as \cite{reynolds-definitional}",
  volume	= 2
}

@Article{	reynolds-definitional,
  author	= "John C. Reynolds",
  title		= "Definitional Interpreters for Higher-Order Programming Languages",
  journal	= j_hosc,
  year		= 1998,
  volume	= 11,
  number	= 4,
  pages		= "363--397",
  url		= "http://www.brics.dk/~hosc/local/HOSC-11-4-pp363-397.pdf ftp://ftp.cs.cmu.edu/user/jcr/defint.ps.gz"
}

@InProceedings{	cunha-framework,
  author	= {Alcino Cunha and Jorge Sousa Pinto and Jos{\'e} Proen\c{c}a},
  title		= {A Framework for Point-Free Program Transformation},
  pages		= {1--18},
  crossref	= {ifl2005}
}

@inProceedings{bove-dybjer:deptypes,
  author        = "Anna Bove and Peter Dybjer",
  title         = "Dependent Types at Work",
  booktitle     = "International Summer School on Language Engineering
        and Rigorous Software Development",
  number        = 5520,
  series        = s_lncs,
  location      = "Uruguay",
  month         = "February 2008",
  year          = 2009,
  url ={\url{http://www.cse.chalmers.se/~bove/Papers/dep_types.pdf}}
}



@PhdThesis{kennedy-dimensions,
  title =       "Programming languages and dimensions",
  author =      "Andrew Kennedy",
  publisher =   "Cambridge [Cambridgeshire] :University of Cambridge,
                 Computer Laboratory,",
  year =        "1995",
  abstract =    "Scientists and engineers must ensure that the
                 equations and formulae which they use are dimensionally
                 consistent, but existing programming languages treat
                 all numeric values as dimensionless. This thesis
                 investigates the extension of programming languages to
                 support the notion of physical dimension. A type system
                 is presented similar to that of the programming
                 language ML but extended with polymorphic dimension
                 types. An algorithm which infers most general dimension
                 types automatically is then described and proved
                 correct. The semantics of the language is given by a
                 translation into an explicitly typed language in which
                 dimensions are passed as arguments to functions. The
                 operational semantics of this language is specified in
                 the usual way by an evaluation relation defined by a
                 set of rules. This is used to show that if a program is
                 well-typed then no dimension errors can occur during
                 its evaluation. More abstract properties of the
                 language are investigated using a denotational
                 semantics: these include a notion of invariance under
                 changes in the units of measure used, analogous to
                 parametricity in the polymorphic lambda calculus.
                 Finally the dissertation is summarised and many
                 possible directions for future research in dimension
                 types and related type systems are described.",
  bibsource =   "OAI-PMH server at alcme.oclc.org",
  oai =         "oai:xtcat.oclc.org:OCLCNo/ocm35674839",
  school =      "University of Cambridge",
  annot  =      "UCAM-CL-TR-391",
}

@InProceedings{	krishnamurthi-synthesizing,
  author	= "Shriram Krishnamurthi and Matthias Felleisen and Daniel P. Friedman",
  title		= "Synthesizing Object-Oriented and Functional Design to Promote Re-Use",
  pages		= "91--113",
  crossref	= "ecoop1998",
  url		= "http://www.ifs.uni-linz.ac.at/~ecoop/cd/papers/1445/14450091.pdf"
}

@InProceedings{	meyer-continuation,
  author	= "Albert R. Meyer and Mitchell Wand",
  title		= "Continuation Semantics in Typed Lambda-Calculi (Summary)",
  pages		= "219--224",
  crossref	= "parikh-logics",
  url		= "ftp://ftp.ccs.neu.edu/pub/people/wand/papers/meyer-wand-85.ps"
}

@Book{		girard-proofs,
  author	= "Jean-Yves Girard and Paul Taylor and Yves Lafont",
  title		= "Proofs and Types",
  booktitle	= "Proofs and Types",
  address	= pub_cambridge_addr,
  publisher	= pub_cambridge,
  year		= 1989,
  url		= "ftp://iml.univ-mrs.fr/pub/lafont/prot.dvi ftp://iml.univ-mrs.fr/pub/lafont/prot.ps.gz ftp://iml.univ-mrs.fr/pub/lafont/prot.pdf",
  isbn		= "0-521-37181-3"
}

@InCollection{	howard-formulae,
  author	= "William A. Howard",
  title		= "The Formulae-as-Types Notion of Construction",
  pages		= "479--490",
  crossref	= "seldin-curry"
}


% ------------------------------------------------------------------------
% Only proceedings follow

@Book{		seldin-curry,
  editor	= "Seldin, Jonathan P. and Hindley, J. Roger",
  title		= "To {H}. {B}. {C}urry: Essays on Combinatory Logic, Lambda Calculus and Formalism",
  booktitle	= "To {H}. {B}. {C}urry: Essays on Combinatory Logic, Lambda Calculus and Formalism",
  address	= pub_ap_addr,
  publisher	= pub_ap,
  year		= 1980,
  isbn		= "0-12-349050-2",
  hollis	= "Widener: WID-LC QA9.2 .T6"
}

@Proceedings{	parikh-logics,
  editor	= "Rohit Parikh",
  title		= "Logics of Programs",
  booktitle	= "Logics of Programs",
  address	= pub_sv_addr,
  publisher	= pub_sv,
  year		= 1985,
  month		= "17--19 "  # jun,
  number	= 193,
  series	= s_lncs,
  isbn		= {3-540-15648-8},
  location	= "Brooklyn"
}

@Proceedings{	ecoop1998,
  editor	= {Eric Jul},
  title		= "Proceedings of {ECCOP}'98: 12th {E}uropean Conference on Object-Oriented Programming",
  booktitle	= "Proceedings of {ECCOP}'98: 12th {E}uropean Conference on Object-Oriented Programming",
  address	= pub_sv_addr,
  publisher	= pub_sv,
  year		= 1998,
  month		= "20--24 "  # jul,
  number	= 1445,
  series	= s_lncs,
  url		= "http://www.ifs.uni-linz.ac.at/~ecoop/cd/tocs/t1445.htm http://www.ifs.uni-linz.ac.at/~ecoop/cd/html/contents.htm",
  isbn		= {3-540-64737-6},
  location	= "Brussels"
}

@Proceedings{	ifl2005,
  editor	= {Andrew Butterfield and Clemens Grelck and Frank Huch},
  title		= {Revised Selected Papers from {IFL} 2005: Implementation and Application of Functional Languages},
  booktitle	= {Revised Selected Papers from {IFL} 2005: Implementation and Application of Functional Languages},
  address	= pub_sv_addr,
  publisher	= pub_sv,
  year		= 2006,
  number	= 4015,
  key		= "IFL05",
  series	= s_lncs
}

@Proceedings{	acm1972,
  key		= "ACM72",
  title		= {Proceedings of the {ACM} National Conference},
  booktitle	= "{Proceedings of the {ACM} National Conference}",
  address	= pub_acm_addr,
  publisher	= pub_acm,
  year		= 1972,
  location	= "Boston"
}

@Proceedings{	afp1995,
  editor	= "Johan Jeuring and Erik Meijer",
  title		= "Advanced Functional Programming: 1st International Spring School on Advanced Functional Programming Techniques",
  booktitle	= "{Advanced Functional Programming: 1st International Spring School on Advanced Functional Programming Techniques}",
  address	= pub_sv_addr,
  publisher	= pub_sv,
  year		= 1995,
  number	= 925,
  series	= s_lncs,
  location	= "Bastad, Sweden"
}

@Proceedings{	esop2000,
  editor	= "Gert Smolka",
  title		= "Programming Languages and Systems: Proceedings of {ESOP} 2000, 9th {E}uropean Symposium on Programming",
  booktitle	= "{Programming Languages and Systems: Proceedings of {ESOP} 2000, 9th {E}uropean Symposium on Programming}",
  address	= pub_sv_addr,
  publisher	= pub_sv,
  year		= 2000,
  number	= 1782,
  series	= s_lncs,
  isbn		= "3-540-67262-1",
  location	= "Berlin"
}

@Proceedings{	haskell2006,
  title		= "Proceedings of the 2006 {H}askell Workshop",
  booktitle	= "{Proceedings of the 2006 {H}askell Workshop}",
  address	= pub_acm_addr,
  publisher	= pub_acm,
  year		= 2006,
  key           = "Haskell06",
  location	= "Seattle, WA"
}


@Proceedings{	icfp2005,
  title		= proc_icfp_1 # "05"  # proc_icfp_2,
  booktitle	= proc_icfp_1 # "05"  # proc_icfp_2,
  address	= pub_acm_addr,
  publisher	= pub_acm,
  key           = "ICFP05",
  year		= 2005,
  isbn		= {1-59593-064-7},
  location	= "Tallinn"
}

@Proceedings{	icfp2006,
  title		= proc_icfp_1 # "06"  # proc_icfp_2,
  booktitle	= proc_icfp_1 # "06"  # proc_icfp_2,
  address	= pub_acm_addr,
  publisher	= pub_acm,
  key           = "ICFP06",
  year		= 2006,
  location	= "Portland, OR"
}

@Proceedings{	icfp2008,
  title		= proc_icfp_1 # "08"  # proc_icfp_2,
  booktitle	= proc_icfp_1 # "08"  # proc_icfp_2,
  address	= pub_acm_addr,
  publisher	= pub_acm,
  year		= 2008,
  key           = "ICFP08",
  location	= "Victoria, British Columbia"
}

@Proceedings{	popl2005,
  editor	= {Jens Palsberg and Mart\'{\i}n Abadi},
  title		= proc_popl_1 # "05"  # proc_popl_2,
  booktitle	= proc_popl_1 # "05"  # proc_popl_2,
  address	= pub_acm_addr,
  publisher	= pub_acm,
  year		= 2005,
  isbn		= {1-58113-830-X},
  key           = "POPL05",
  location	= {Long Beach, CA}
}

@Proceedings{	msfp2006,
  editor	= "Conor McBride and Tarmo Uustalu",
  title		= "{MSFP} 2006: Workshop on Mathematically Structured Functional Programming",
  booktitle	= "{MSFP} 2006: Workshop on Mathematically Structured Functional Programming",
  publisher	= "British Computer Society",
  year		= 2006,
  month		= "2~"  # jul,
  series	= "Electronic Workshops in Computing",
  url		= "http://cs.ioc.ee/mpc-amast06/msfp/ http://www.bcs.org/server.php?show=nav.00100v005003001001002",
  key           = "MSFP06",
  location	= "Kuressaare, Estonia"
}

@Proceedings{	padl2004,
  editor	= {Bharat Jayaraman},
  title		= "{Practical Aspects of Declarative Languages: 6th International Symposium, {PADL} 2004}",
  booktitle	= "{Practical Aspects of Declarative Languages: 6th International Symposium, {PADL} 2004}",
  address	= pub_sv_addr,
  publisher	= pub_sv,
  year		= 2004,
  month		= "18--19 "  # jun,
  number	= 3057,
  series	= s_lncs,
  isbn		= {3-540-22253-7},
  key           = "PADL04",
  location	= "Dallas, TX"
}

@Proceedings{	ppdp2001,
  title		= "Proceedings of the 3rd International Conference on Principles and Practice of Declarative Programming",
  booktitle	= "Proceedings of the 3rd International Conference on Principles and Practice of Declarative Programming",
  address	= pub_acm_addr,
  publisher	= pub_acm,
  year		= 2001,
  key           = "PPDP01",
  month		= sep,
  location	= "Florence, Italy"
}

@Proceedings{	tfp2007-draft,
  editor	= "Marco T. Moraz{\'a}n and Henrik Nilsson",
  title		= "Draft Proceedings of {TFP} 2007: 6th Symposium on Trends in Functional Programming",
  booktitle	= "{Draft Proceedings of {TFP} 2007: 6th Symposium on Trends in Functional Programming}",
  publisher	= "Department of Mathematics and Computer Science, Seton Hall University",
  year		= 2007,
  number	= "TR-SHU-CS-2007-04-1",
  series	= techreport,
  key           = "TFP07",
  url		= "http://cs.shu.edu/tfp2007/draftProcDocument.pdf",
  location	= "New York"
}

@Proceedings{	ml2005,
  title		= "Proceedings of the 2005 Workshop on {ML}",
  booktitle	= "Proceedings of the 2005 Workshop on {ML}",
  year		= 2005,
  month		= sep,
  series	= s_entcs,
  url		= "http://ttic.uchicago.edu/~blume/ml05/",
  annote	= "To be published as a volume of ENTCS",
  key           = "ML05",
  location	= "Tallinn"
}

@Proceedings{	haskell2008,
  editor	= "Andrew Gill",
  title		= "Proceedings of the 1st {ACM} {SIG{\-}PLAN} Symposium on {H}askell",
  booktitle	= "Proceedings of the 1st {ACM} {SIG{\-}PLAN} Symposium on {H}askell",
  address	= pub_acm_addr,
  publisher	= pub_acm,
  year		= 2008,
  month		= "25~"  # sep,
  isbn		= {978-1-60558-064-7},
  key           = "Haskell08",
  location	= "Victoria, BC"
}

