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....Pages 1-22
Fifth generation computer project: Current research activity and future plans....Pages 23-38
A compositive abstraction algorithm for combinatory logic....Pages 39-51
Linear logic and lazy computation....Pages 52-66
The natural dynamic semantics of mini-Standard ML....Pages 67-81
Listlog — A PROLOG extension for list processing....Pages 82-95
Intensional negation of logic programs: Examples and implementation techniques....Pages 96-110
Improving the execution speed of compiled Prolog with modes, clause selection, and determinism....Pages 111-125
Simulation results of a multiprocessor PROLOG architecture based on a distributed and/or graph....Pages 126-139
Generating efficient code from strictness annotations....Pages 140-154
Hoisting: Lazy evaluation in a cold climate....Pages 155-166
Inductive assertion method for logic programs....Pages 167-181
Higher order generalization in program derivation....Pages 182-196
Implementing algebraically specified abstract data types in an imperative programming language....Pages 197-211
A declarative environment for concurrent logic programming....Pages 212-242
Or-parallel execution models of Prolog....Pages 243-259
Retractions: A functional paradigm for logic programming....Pages 260-275
Refined strategies for semantic unification....Pages 276-290
Extensional models for polymorphism....Pages 291-307
A type discipline for program modules....Pages 308-319
Theory and practice of canonical term functors in abstract data type specifications....Pages 320-334