Abstract is missing.
- Lambda-representable Functions over Free Structures RevisitedMasako Takahashi. 1-19
- Computing with Abstract Böhm TreesPierre-Louis Curien, Hugo Herbelin. 20-39
- Postponing Redex Contractions in Equational ProgramsNadia Nedjah. 40-60
- Towards Manipulation of Mutually Recursive FunctionsHideya Iwasaki, Zhenjiang Hu, Masato Takeichi. 61-79
- Distributed Haskell: Goffin on the InternetManuel M. T. Chakravarty, Yike Guo, Martin Köhler. 80-97
- Prological Features in a Functional Setting Axioms and ImplementationRalf Hinze. 98-122
- On the Semantics of GAEAHiroshi Ishikawa, Takuo Watanabe, Kokichi Futatsugi, José Meseguer, Hideyuki Nakashima. 123-142
- A Functional View of Rewriting and Strategies for a Semantics of ELANPeter Borovanský, Claude Kirchner, Hélène Kirchner. 143-166
- Categorial Model Construction for Proving Syntactic PropertiesTakafumi Sakurai. 187-206
- A Type Theory for Cyclic StrctureIzumi Takeuti. 207-226
- Type-free Equational Reasoning in the Theeory of Inductively Defined TypesYasuyuki Tsukada. 227-246
- Semantics Modifiers: An Approach to Non-Standard Semantics of Programming LanguagesSergei M. Abramov, Robert Glück. 247-270
- Online Type-Directed Partial EvaluationOlivier Danvy. 271-295
- Two-Stage ProgrammingEdgar F. A. Lederer, Romeo A. Dumitrescu. 296-313