This book discusses issues concerning functional programming, logic programming, and integration of the two. The topics include language design, formal semantics, type theory, compilation techniques, program transformation, programming methods, integration of programming paradigms, constraint solving, and distributed computation.Contents:λ-Representable Functions Over Free Structures Revisited (M Takahashi)Computing with Abstract Böhm Trees (P-L Curien & H Herbelin)Postponing Redex Contractions in Equational Programs (N Nedjah)Towards Manipulation of Mutually Recursive Functions (H Iwasaki et al)Distributed Haskell: Goffin on the Internet (M M T Chakravarty et al)Prological Features in a Functional Setting Axioms and Implementations (R Hinze)On the Semantics of GAEA (H Ishikawa et al)A Functional View of Rewriting and Strategies for a Semantics of ELAN (P Borovanský)Rewriting Logic for Cyclic Sharing Structures (Extended Abstract) (H Miyoshi)Categorical Model Construction for Proving Syntactic Properties (T Sakurai)A Type Theory for Cyclic Structure (I Takeuti)Type-Free Equational Reasoning in the Theory of Inductively Defined Types (Y Tsukada)Semantics Modifiers: An Approach to Non-Standard Semantics of Programming Languages (S Abramov & R Glück)Online Type-Directed Partial Evaluation (O Danvy)Two-Stage Programming (E F A Lederer & R A Dumitrescu)Readership: Graduate students in the theoretical foundations of computer science.