19. IFL 2007: Freiburg, Germany

• Steffen Mazanek, Mark Minas:
  Graph Parser Combinators. 1-18
  
• Huiqing Li, Simon Thompson:
  Testing Erlang Refactorings with QuickCheck. 19-36
  
• Marco T. Morazán, Ulrik Pagh Schultz:
  Optimal Lambda Lifting in Quadratic Time. 37-56
  
• Atze Dijkstra, Jeroen Fokker, S. Doaitse Swierstra:
  The Structure of the Essential Haskell Compiler, or Coping with Compiler Complexity. 57-74
  
• Martin Sulzmann, Kenny Zhuo Ming Lu:
  XHaskell - Adding Regular Expression Types to Haskell. 75-92
  
• Malcolm Wallace:
  Partial Parsing: Combining Choice with Commitment. 93-110
  
• Robert Bruce Findler, Shu-yu Guo, Anne Rogers:
  Lazy Contract Checking for Immutable Data Structures. 111-128
  
• Matthew Naylor, Colin Runciman:
  The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction Using an FPGA. 129-146
  
• Neil Mitchell, Colin Runciman:
  A Supercompiler for Core Haskell. 147-164
  
• Dirk Kleeblatt:
  Checking Dependent Types Using Compiled Code. 165-182
  
• Bernd Braßel, Holger Siegel:
  Debugging Lazy Functional Programs by Asking the Oracle. 183-200
  
• Edsko de Vries, Rinus Plasmeijer, David M. Abrahamson:
  Uniqueness Typing Simplified. 201-218
  
• Baltasar Trancón-y-Widemann, David Lorge Parnas:
  Tabular Expressions and Total Functional Programming. 219-236
  
• Marc Feeley:
  Speculative Inlining of Predefined Procedures in an R5RS Scheme to C Compiler. 237-253
  
• Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky, Clemens Grelck, Kai Trojahner:
  From Contracts Towards Dependent Types: Proofs by Partial Evaluation. 254-273