Declarative Programming, Sasbachwalden 1991

1. Front Matter

   Pages i-viii

   PDF

2. Languages and Semantics

   1. Front Matter

      Pages 1-1

      PDF

   2. A Design Space for Integrating Declarative Languages

      • John Darlington, Yike Guo, Helen Pull

      Pages 3-19

   3. Introducing Constraint Functional Logic Programming

      • John Darlington, Yike Guo, Helen Pull

      Pages 20-34

   4. How to Use Guarded Functional Programming

      • Roland Dietrich

      Pages 35-50

   5. Enriching Prolog with S-Unification

      • Andreas Kågedal, Feliks Kluźniak

      Pages 51-65

   6. A Tiny Functional Language with Logical Features

      • Ross Paterson

      Pages 66-79

3. Parallelism and Concurrency

   1. Front Matter

      Pages 81-81

      PDF

   2. Temporal Constraint Functional Programming: A Declarative Framework for Concurrency and Interaction

      • T. C. Nicholas Graham

      Pages 83-100

   3. Eight queens divided: an experience in parallel functional programming

      • K. G. Langendoen, W. G. Vree

      Pages 101-115

   4. Intelligent Backtracking in And-Parallel Prolog

      • Andrew Verden, Hugh Glaser

      Pages 116-130

4. Modules and Types

   1. Front Matter

      Pages 131-131

      PDF

   2. Parameterized Interfaces are Interfaces — AIAS

      • Sophia Drossopoulou, Ross Paterson, Susan Eisenbach

      Pages 133-147

   3. Type Classes are Signatures of Abstract Types

      • Konstantin Läufer, Martin Odersky

      Pages 148-162

   4. Syntactic and Semantic Inheritance in Logic Programming

      • Luís Monteiro, António Porto

      Pages 163-173

5. Implementation

   1. Front Matter

      Pages 175-175

      PDF

   2. A survey of the implementations of narrowing

      • P. H. Cheong, L. Fribourg

      Pages 177-187

   3. A Systematic Method for Designing Abstract Narrowing Machines

      • Hendrik C. R. Lock

      Pages 188-203

   4. Some Algorithms for Fast and Complete Execution of Logic Programs

      • Roland Olsson

      Pages 204-223

   5. A Common Graphical Form

      • David Parrott, Chris Clack

      Pages 224-238

Declarative programming languages are based on sound mathematical foundations which means that they offer many advantages for software development. These advantages include their powerful descriptive capabilities, the availability of program analysis techniques and the potential for parallel execution. This volume contains the proceedings of a seminar and workshop organised by the Esprit Basic Research Action Phoenix in collaboration with the Esprit Basic Research Action Integration. Both these groups have been closely involved in investigating the foundations of declarative programming and the integration of various language paradigms, as well as the developing aspects of related technology. The main aim of the seminar and workshop was to provide a forum for the results of this work, together with contributions from other researchers in the same field. These papers cover a variety of important technical areas such as foundations and languages, program transformation and analysis, integrated approaches, implementation techniques, abstract machines and programming methodology. The resulting volume provides an in-depth picture of current research into declarative programming. It will be of special interest to researchers in programming languages and methodology, students of artificial intelligence and anyone involved in industrial research and development.

• Logic Programming
• Mathematica
• artificial intelligence
• declarative programming
• development
• functional programming
• language
• program transformation
• programming
• programming language
• software

• Department of Computing, Imperial College of Science, Technology and Medicine, London, UK

  John Darlington

• GMD Forschungsstelle, Universität Karlsruhe, Karlsruhe 1, Germany

  Roland Dietrich

Policies and ethics