5. ICFP 2000: Montreal, Canada

• Limsoon Wong:
  The functional guts of the Kleisli query system. 1-10
  Electronic Edition (ACM DL) BibTeX
• Haruo Hosoya, Jerome Vouillon, Benjamin C. Pierce:
  Regular expression types for XML. 11-22
  Electronic Edition (ACM DL) BibTeX
• Christian Queinnec:
  The influence of browsers on evaluators or, continuations to program web servers. 23-33
  Electronic Edition (ACM DL) BibTeX
• Christian Skalka, Scott F. Smith:
  Static enforcement of security with types. 34-45
  Electronic Edition (ACM DL) BibTeX
• François Pottier, Sylvain Conchon:
  Information flow inference for free. 46-57
  Electronic Edition (ACM DL) BibTeX
• Stephanie Weirich:
  Type-safe cast: functional pearl. 58-67
  Electronic Edition (ACM DL) BibTeX
• Karl Crary:
  Typed compilation of inclusive subtyping. 68-81
  Electronic Edition (ACM DL) BibTeX
• Valery Trifonov, Bratin Saha, Zhong Shao:
  Fully reflexive intensional type analysis. 82-93
  Electronic Edition (ACM DL) BibTeX
• Manuel M. T. Chakravarty, Gabriele Keller:
  More types for nested data parallel programming. 94-105
  Electronic Edition (ACM DL) BibTeX
• Meurig Sage:
  FranTk - a declarative GUI language for Haskell. 106-117
  Electronic Edition (ACM DL) BibTeX
• Brian McNamara, Yannis Smaragdakis:
  Functional programming in C++. 118-129
  Electronic Edition (ACM DL) BibTeX
• Robert Harper, Benjamin C. Pierce:
  Advanced module systems: a guide for the perplexed (abstract of invited talk). 130
  Electronic Edition (ACM DL) BibTeX
• Chris Okasaki:
  Breadth-first numbering: lessons from a small exercise in algorithm design. 131-136
  Electronic Edition (ACM DL) BibTeX
• Isao Sasano, Zhenjiang Hu, Masato Takeichi, Mizuhito Ogawa:
  Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems. 137-149
  Electronic Edition (ACM DL) BibTeX
• Karl-Filip Faxén:
  Cheap eagerness: speculative evaluation in a lazy functional language. 150-161
  Electronic Edition (ACM DL) BibTeX
• Clement A. Baker-Finch, David J. King, Philip W. Trinder:
  An operational semantics for parallel lazy evaluation. 162-173
  Electronic Edition (ACM DL) BibTeX
• Levent Erkök, John Launchbury:
  Recursive monadic bindings. 174-185
  Electronic Edition (ACM DL) BibTeX
• Ralf Hinze:
  Deriving backtracking monad transformers. 186-197
  Electronic Edition (ACM DL) BibTeX
• Rowan Davies, Frank Pfenning:
  Intersection types and computational effects. 198-208
  Electronic Edition (ACM DL) BibTeX
• Daniel Damian, Olivier Danvy:
  Syntactic accidents in program analysis: on the impact of the CPS transformation. 209-220
  Electronic Edition (ACM DL) BibTeX
• Vladimir Gapeyev, Michael Y. Levin, Benjamin C. Pierce:
  Recursive subtyping revealed: functional pearl. 221-231
  Electronic Edition (ACM DL) BibTeX
• Pierre-Louis Curien, Hugo Herbelin:
  The duality of computation. 233-243
  Electronic Edition (ACM DL) BibTeX
• Carl-Johan H. Seger:
  Combining functional programming and hardware verification (abstract of invited talk). 244
  Electronic Edition (ACM DL) BibTeX
• Manuel Serrano, Hans-Juergen Boehm:
  Understanding memory allocation of scheme programs. 245-256
  Electronic Edition (ACM DL) BibTeX
• Andrew M. Cheadle, A. J. Field, Simon Marlow, Simon L. Peyton Jones, R. Lyndon While:
  Non-stop Haskell. 257-267
  Electronic Edition (ACM DL) BibTeX
• Koen Claessen, John Hughes:
  QuickCheck: a lightweight tool for random testing of Haskell programs. 268-279
  Electronic Edition (ACM DL) BibTeX
• Simon L. Peyton Jones, Jean-Marc Eber, Julian Seward:
  Composing contracts: an adventure in financial engineering, functional pearl. 280-292
  Electronic Edition (ACM DL) BibTeX