## Foundations of Logic and Functional Programming: Workshop, Trento, Italy, December 15-19, 1986. ProceedingsThis volume consists of some of the papers that were delivered during the workshop on "Foundations of Logic and Functional Programming" held in Trento, Italy, from December 15th to 19th, 1986. The meeting centered on themes and trends in Functional Programming and in Logic Programming. This book contains five papers contributed by the invited speakers and five selected contributions. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

An intensional theory of function and control abstractions | 3 |

Typechecking dependent types and subtypes | 45 |

Reducing recursion to iteration by means of pairs and Ntuples | 58 |

Unification revisited | 67 |

Rule rewriting methods for efficient implementations of Horn logic | 114 |

Submitted Contributions | 141 |

a logic programming system based on a constructive logic | 143 |

A completeness result for Eunification algorithms based on conditional narrowing | 157 |

Representing domain structure of manysorted Prolog knowledge bases | 168 |

An inference engine prototype to implement intelligent systems | 184 |

Hints for the design of a set calculus oriented to Automated Deduction | 201 |

### Other editions - View all

### Common terms and phrases

abstract agent algebra algorithm allows appear application approach argument assume axioms base basic calculus called complete computation concepts conditional consider constant constructs contains context continuation corresponding data structures database Deduction defined definition denoted derived domain element eliminable environment equality equation set equivalent example exists expressions extended fact Figure finite fixpoint formal formula function GIVE given goal graph ground idempotent implementation inequations inference instance interpretation introduce Italy iteration knowledge language logic Logic Programming magic set means method namely nodes obtained operations parameters pfns possible predicate present problem Proceedings programs proof properties proved provides query reasoning recursive relation represent restricted result rewriting rules semantics sequence single solution solved form sort step structure substitution symbols theorem theory tree true unification unifier universe variables