## Search

Now showing items 1-10 of 28

#### A Semantics for Static Type Inference

(SPRINGER VERLAG, 1991)

Curry’s system for F-deducibility is the basis for static type inference
algorithms for programming languages such as ML. If a natural
“preservation of types by conversion” rule is added to Curry’s system, it
becomes ...

#### On Functors Expressible in the Polymorphic Typed Lambda Calculus

(Information and Computation, 1991)

Given a model of the polymorphic typed lambda calculus based upon a Cartesian
closed category K, there will be functors from K to K whose action on objects can be
expressed by type expressions and whose action on morphisms ...

#### Decidability, Behavioural Equivalences and Infinite Transition Graphs

(University of Edinburgh. College of Science and Engineering. School of Informatics., 1991-07)

This thesis studies behavioural equivalences on labelled infinite transition graphs and the role that they can play in the context of modal logics and notions from language theory. A natural class of such infinite graphs ...

#### Correctness-Oriented Approaches to Software Development

(University of Edinburgh. College of Science and Engineering. School of Informatics.The Queen's University of Belfast; Faculty of Science, 1991-07)

This thesis reports upon the experimental development of a software system. The domain of interest of this study is the use of mathematical reasoning in software development. An experiment is devised in which a modular ...

#### A Recursive Techniques Editor for Prolog

(SpringerLink, 1991-03)

We describe an editor geared to recursive Prolog procedures. It is similar to the structure editors built for many programming languages, except that instead of just ensuring the correctness of the syntax of the procedures ...

#### The Polyadic pi-Calculus: A Tutorial

(The University of Edinburgh, 1991)

The pi-calculus is a model of concurrent computation based upon the notion of naming. It is first presented in its simplest and original form, with the help of several illustrative applications. Then it is generalized from ...

#### Scale-based surface understanding using diffusion smoothing

(The University of Edinburgh, 1991)

The research discussed in this thesis is concerned with surface understanding from the
viewpoint of recognition-oriented, scale-related processing based on surface curvatures and
diffusion smoothing. Four problems below ...

#### Verifying temporal properties of systems with applications to petri nets

(The University of Edinburgh, 1991)

This thesis provides a powerful general-purpose proof technique for the verification
of systems, whether finite or infinite. It extends the idea of finite local
model-checking, which was introduced by Stirling and Walker: ...

#### Fuzzy qualitative simulation and diagnosis of continuous dynamic systems.

(University of Edinburgh, 1991)