Browsing South African Computer Journal 1993(9) by Type "Article"

Now showing items 1-4 of 4

Deduction systems based on resolution

Eisinger, N; Ohlbach, HJ (South African Computer Society (SAICSIT), 1993)

A general theory of deduction systems is presented The theory is illustrated with deduction systems based on the resolution calculus, in particular with clause graphs. This theory distinguishes four constituents of a ...
Denotational semantics and domain theory

Goslett, J.; Hulley, H; Melton, A (South African Computer Society (SAICSIT), 1993)

This tutorial is an introduction to denotational semantics and domain theory. For this reason the presentation is not entirely rigorous, with some proofs being omitted and certain simplifying assumptions being made. Instead, ...
Introduction to computability theory

Zucker, J; Pretorius, L (South African Computer Society (SAICSIT), 1993)

These are notes for a short introductory course on Computability Theory (or recursive function theory). The basic notion of computability is defined in terms of a simple imperative programming language.
A working relational model: The derivation of the Dijkstra-Scholten predicate transformer semantics from Tarski's axioms for the Peirce-Schroder calculus of relations

Maddux, RD (South African Computer Society (SAICSIT), 1993)

The definitions for Dijkstra's predicate transformer semantics can be justified by considering the meaning of a program as a binary relation on states (which holds between two states if there is a terminating computation ...

Search UnisaIR