The Journal of Functional Programming, Volume 14

Volume 14, Number 1, January 2004

• Gilles Barthe, Peter Dybjer, Peter Thiemann:
  Introduction to the Special Issue on Dependent Type Theory Meets Practical Programming. 1-2
  
• Andrew W. Appel, Amy P. Felty:
  Dependent types ensure partial correctness of theorem provers. 3-19
  
• Christoph Kreitz:
  Building reliable, high-performance networks with the Nuprl proof development system. 21-68
  
• Conor McBride, James McKinna:
  The view from the left. 69-111
  

• Manuel M. T. Chakravarty, Gabriele Keller:
  The risks and benefits of teaching purely functional programming in first year. 113-123
  

• Chris Reade:
  "Proof, Language and Interaction, Essays in Honour of Robin Milner" by Gordon Plotkin, Colin Sterling and Mads Tofte (eds.), Foundations of Computing Series, MIT Press 2000. 125-128
  

Volume 14, Number 2, March 2004

• Pieter H. Hartel, Henk L. Muller, Hugh Glaser:
  The Functional "C" experience. 129-135
  

• Aarne Ranta:
  Grammatical Framework. 145-189
  
• Clement A. Baker-Finch, Kevin Glynn, Simon L. Peyton Jones:
  Constructed product result analysis for Haskell. 211-245
  

• Mike Thomas:
  "An Introduction to Computing with Haskell" by Manuel M. T. Chakravarty and Gabrielle C. Keller, Pearson SprintPrint, 2002, ISBN 1 74009 404 2. 247-249
  
• Eugene Wallingford:
  "Practical Aspects of Declarative Languages" by Shriram Krishnamurthi and C. R. Ramakrishnan (eds.), LNCS 2257, Springer-Verlag, 2002. ISBN 3-540-43092-X. 249-251
  

Volume 14, Number 3, May 2004

• Martin Erwig:
  Escape from Zurg: an exercise in logic programming. 253-261
  

• Gérard Boudol:
  The recursive record semantics of objects revisited. 263-315
  
• Janis Voigtländer, Armin Kühnemann:
  Composition of functions with accumulating parameters. 317-363
  

Volume 14, Number 4, July 2004

• Paul Hudak, Greg Morrisett:
  Editorial.
  

• Matthias Felleisen, Robert Bruce Findler, Matthew Flatt, Shriram Krishnamurthi:
  The structure and interpretation of the computer science curriculum. 365-378
  

• Jürgen Giesl, Aart Middeldorp:
  Transformation techniques for context-sensitive rewrite systems. 379-427
  
• Brian McNamara, Yannis Smaragdakis:
  Functional programming with the FC++ library. 429-472
  

Volume 14, Number 5, September 2004

• Timothy J. Hickey:
  Computer literacy via Scheme and web programming. 475-488
  

• John Hughes:
  Global variables in Haskell. 489-502
  
• M. Douglas McIlroy:
  Enumerating the strings of regular languages. 503-518
  

• Mário Florido, Luís Damas:
  Linearization of the lambda-calculus and its relation with intersection type systems. 519-546
  
• Tim Sheard, Emir Pasalic:
  Two-level types and parameterized modules. 547-587
  

• Nimish Shah:
  Knowledge Representation, Reasoning and Declarative Problem Solving by C. Baral, Cambridge University Press, 2003. 588-589
  
• Mike Thomas:
  Reasoning About Program Transformations: Imperative Programming and Flow of Data by Jean-Francois Collard, Springer-Verlag, 2003. 589-592
  
• Frédéric Loulergue:
  Développement d'applications avec Objective CAML by E. Chailloux, P. Manoury and B. Pagano, O'Reilley, 2003. 592-594
  
• Peter Hancock:
  The Fun of Programming edited by Jeremy Gibbons and Oege de Moor, Palgrave Macmillan, 2003. 594-597
  
• John Derrick:
  Programming Methodology A. McIver and C. Morgan, editors, Springer-Verlag, 2002. 597-598
  
• Nimish Shah:
  Program Construction: Calculating Implementations from Specifications by R.C. Backhouse, John Wiley & Sons, 2004. 598-600
  

Volume 14, Number 6, November 2004

• Ralf Hinze:
  Special issue on functional pearls Editorial. 601-601
  

• Richard S. Bird, Shin-Cheng Mu:
  Inverting the Burrows-Wheeler transform. 603-612
  
• Richard S. Bird:
  On tiling a chessboard. 613-622
  
• Harry G. Mairson:
  Linear lambda calculus and PTIME-completeness. 623-633
  
• Arthur I. Baars, Andres Löh, S. Doaitse Swierstra:
  Parsing permutation phrases. 635-646
  
• Luc Maranget:
  Functional satisfaction. 647-656
  
• Sergio Antoy, Michael Hanus:
  Concurrent distinct choices. 657-668
  
• Peter Ljunglöf:
  Functional chart parsing of context-free grammars. 669-680
  
• Stephanie Weirich:
  Type-safe cast. 681-695
  
• John T. O'Donnell, Gudula Rünger:
  Derivation of a logarithmic time carry lookahead addition circuit. 697-713
  
• Mark P. Jones:
  Composing fractals. 715-725
  
• Andrew Kennedy:
  Pickler combinators. 727-739
  
• Koen Claessen:
  Parallel Parsing Processes. 741-757
  
• Lambert G. L. T. Meertens:
  Calculating the Sieve of Eratosthenes. 759-763