ESOP '90

Types in lambda calculi and programming languages.- Symbolic finite differencing - Part I.- Implementation of an interpreter for a parallel language in centaur.- Automatic autoprojection of higher order recursive equations.- From interpreting to compiling binding times.- Implementing finite-domain constraint logic programming on top of a PROLOG-system with delay-mechanism.- Type inference for action semantics.- On the expressive power of programming languages.- Higher order escape analysis: Optimizing stack allocation in functional program implementations.- Development of concurrent systems by incremental transformation.- Set domains.- Resolution and Type Theory.- A syntactic theory of transparent parameterization.- A backwards analysis for compile-time garbage collection.- Techniques for improving grammar Flow Analysis.- The specificity rule for lazy pattern-matching in ambiguous term rewrite systems.- Graph-based implementation of a functional logic language.- Eureka definitions for free! or Disagreement points for fold/unfold transformations.- Synthesis of eureka predicates for developing logic programs.- Algebraic properties of program integration.- Arity raiser and its use in program specialization.- Complexity analysis for a lazy higher-order language.- On the weak adequacy of branching-time temporal logic.- The value flow graph: A program representation for optimal program transformations.- Type inference and implicit scaling.- Towards the theory of programming in constructive logic.