


default search action
2. TAPSOFT 1987: Pisa, Italy
- Hartmut Ehrig, Robert A. Kowalski, Giorgio Levi, Ugo Montanari:

TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Functional and Logic Programming and Specifications (CFLP). Lecture Notes in Computer Science 250, Springer 1987, ISBN 3-540-17611-X
AS Session 1
- Joseph A. Goguen, José Meseguer:

Models and Equality for Logical Programming. 1-22 - Koichi Furukawa:

Fifth Generation Computer Project: Current Research Activity and Future Plans. 23-38
Theory and Semantics of Functional Languages (CFLP Session 1)
- Adolfo Piperno:

A Compositive Abstraction Algorithm for Combinatory Logic. 39-51 - Jean-Yves Girard, Yves Lafont:

Linear Logic and Lazy Computation. 52-66 - Dominique Clément:

The Natural Dynamic Semantics of Mini-Standard ML. 67-81
Language Features and Compilation in Logic Programming (CFLP Session 2)
- Zsuzsa Farkas:

LISTLOG - A Prolog Extension for List Processing. 82-95 - Roberto Barbuti, Paolo Mancarella, Dino Pedreschi

, Franco Turini:
Intensional Negation of Logic Programs: Examples and Implementation Techniques. 96-110 - Peter Van Roy, Bart Demoen, Yves D. Willems:

Improving the Execution Speed of Compiled Prolog with Modes, Clause Selection, and Determinism. 111-125
Implementation Techniques (CFLP Session 3)
- Christian Percebois, Ivan Futó, Irène Durand, Catherine Simon, Brigitte Bonhoure:

Simulation Results of a Multiprocessor Prolog Architecture Based on a Distributed and/or Graph. 126-139 - Gary Lindstrom, Lal George, Dowming Yeh:

Generating Efficient Code from Strictness Annotations. 140-154 - Simon Finn:

Hoisting: Lazy Evaluation in a Cold Climate. 155-166
Program Proving and Transformation (CFLP Session 4)
- Wlodzimierz Drabent

, Jan Maluszynski:
Inductive Assertion Method for Logic Programs. 167-181 - Alberto Pettorossi

, Andrzej Skowron:
Higher Order Generalization in Program Derivation. 182-196 - Muffy Thomas:

Implementing Algebraically Specified Abstract Data Types in an Imperative Programming Language. 197-211
AS Session 3
- Keith L. Clark, Ian T. Foster

:
A Declarative Environment for Concurrent Logic Programming. 212-242 - David H. D. Warren:

Or-Parallel Execution Models of Prolog. 243-259
Unification of Functional and Logic Programming Languages (CFLP Session 5)
- Marco Bellia:

Retractions: A Functional Paradigm for Logic Programming. 260-275 - Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso:

Refined Strategies for Semantic Unification. 276-290
Types, Polymorphism and Abstract Data TYpe Specifications (CFLP Session 6)
- Val Tannen, Thierry Coquand:

Extensional Models for Polymorphism. 291-307 - Robert Harper, Robin Milner, Mads Tofte:

A Type Discipline for Program Modules. 308-319 - Christoph Beierle, Angi Voß

:
Theory and Practice of Canonical Term Functors in Abstract Data Type Specifications. 320-334

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














