Institutional Repository

Browsing Quaestiones Informaticae (QI) by Author "Postma, Stef W."

Browsing Quaestiones Informaticae (QI) by Author "Postma, Stef W."

Sort by: Order: Results:

  • Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Quadlisp is a symbol manipulation language for sophisticated users, and it is an improper extension of Lisp 1.5 (in the same sense that Pascal is an improper extension of Algol). Elements from Lisp thus are basic to the ...
  • Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1980)
    The language LISP 1.5 is neither easy to write nor to read. In the McCarthy etal. definitive manual on LISP 1.5 a higher level language, MLISP, is used From the early 1960's various people have proposed higher level ...
  • Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    The Department of Computer Science of the Pietermaritzburg Campus of the University of Natal is one of the youngest departments in the country, although service courses to the Faculty of Commerce have been available ...
  • Postma, Stef W.; Philips, N.C.K. (S W Postma and N C K Phillips (1988) The parallel conditional. Computer Society of South Africa (on behalf of SAICSIT), 1988)
    The parallel conditional is a new but natural programming language construct. It is particularly suited to evaluation on parallel maclunes and generalizes other well known conditionals.
  • Philips, N.C.K.; Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1987)
    The distinction between an abstract data type and an implementation of a data type is not as clear as is commonly thought. A hash table can be used to implement the type bag but few of our colleagues think of a hash table ...
  • Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1984)
    The paper is concerned with computer science as a science and the training required by its scientific practitioners-tobe. The background and objectives for a curriculum design are briefly sketched, and a taxonomy is given ...
  • Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Two topics are studied, related and generalised in this paper - the Knuth transform of an arbitrary tree to a binary tree, and Pfaltz' s definition of a data structure as a graph with assignments. Trees are defined in ...

Search UnisaIR


Browse

My Account