Table of contents : Types in lambda calculi and programming languages....Pages 1-35 Symbolic finite differencing - Part I....Pages 36-56 Implementation of an interpreter for a parallel language in centaur....Pages 57-69 Automatic autoprojection of higher order recursive equations....Pages 70-87 From interpreting to compiling binding times....Pages 88-105 Implementing finite-domain constraint logic programming on top of a PROLOG-system with delay-mechanism....Pages 106-117 Type inference for action semantics....Pages 118-133 On the expressive power of programming languages....Pages 134-151 Higher order escape analysis: Optimizing stack allocation in functional program implementations....Pages 152-160 Development of concurrent systems by incremental transformation....Pages 161-176 Set domains....Pages 177-196 Resolution and Type Theory....Pages 197-211 A syntactic theory of transparent parameterization....Pages 212-226 A backwards analysis for compile-time garbage collection....Pages 227-239 Techniques for improving grammar Flow Analysis....Pages 240-255 The specificity rule for lazy pattern-matching in ambiguous term rewrite systems....Pages 256-270 Graph-based implementation of a functional logic language....Pages 271-290 Eureka definitions for free! or Disagreement points for fold/unfold transformations....Pages 291-305 Synthesis of eureka predicates for developing logic programs....Pages 306-325 Algebraic properties of program integration....Pages 326-340 Arity raiser and its use in program specialization....Pages 341-360 Complexity analysis for a lazy higher-order language....Pages 361-376 On the weak adequacy of branching-time temporal logic....Pages 377-388 The value flow graph: A program representation for optimal program transformations....Pages 389-405 Type inference and implicit scaling....Pages 406-420 Towards the theory of programming in constructive logic....Pages 421-435