Now showing items 31-34 of 34
On a Question of H. Friedman
(ACADEMIC PRESS INC, 1996)
In this paper we answer a question of Friedman, providing an ω-separable model M of the λβη-calculus. There therefore exists an α-separable model for any α≥0. The model M permits no non-trivial enrichment as a partial ...
Logical Full Abstraction and PCF
We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard ...
A Per Model of Polymorphism and Recursive Types
A model of Reynolds’ polymorphic lambda calculus is provided, which also allows the recursive definition of elements and types. The technique is to use a good class of partial equivalence relations over a certain cpo. ...
Automatic Methods of Inductive Inference
(The University of Edinburgh, 1972)
This thesis is concerned with algorithms for generating generalisations-from experience. These algorithms are viewed as examples of the general concept of a hypothesis discovery system which, in its turn, is placed in ...