TAPSOFT '87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23 - 27 1987

Models and equality for logical programming.- Fifth generation computer project: Current research activity and future plans.- A compositive abstraction algorithm for combinatory logic.- Linear logic and lazy computation.- The natural dynamic semantics of mini-Standard ML.- Listlog — A PROLOG extension for list processing.- Intensional negation of logic programs: Examples and implementation techniques.- Improving the execution speed of compiled Prolog with modes, clause selection, and determinism.- Simulation results of a multiprocessor PROLOG architecture based on a distributed and/or graph.- Generating efficient code from strictness annotations.- Hoisting: Lazy evaluation in a cold climate.- Inductive assertion method for logic programs.- Higher order generalization in program derivation.- Implementing algebraically specified abstract data types in an imperative programming language.- A declarative environment for concurrent logic programming.- Or-parallel execution models of Prolog.- Retractions: A functional paradigm for logic programming.- Refined strategies for semantic unification.- Extensional models for polymorphism.- A type discipline for program modules.- Theory and practice of canonical term functors in abstract data type specifications.