All the following topics are discussed in more detail through the notes in this Models of Computation section.

Sets allow the properties of programs to be defined. The "Z" specification language is based on Zermelo-Fraenkel set theory and first order predicate logic. The Programming Research Group (PRG) has been involved in its development since the late 70s.

Lists form the basis for many programming constructs and can be of different types stack or array. A stack is a data structure which stores items that are then accessed in last-in first-out (LIFO) order. Items are "popped" (removed) from the top of a stack or "pushed" (added) to the top of a stack. A queue is a first-in first-out (FIFO) data structure where items are added to the queue's tail and taken off the head.

Recursive algorithms involve the repetition of code. Specifically, the function or procedure calls itself. If a function will continually call itself regardless of how it is called initially, then it will never terminate.

Compilers require the valid syntax for the language. The semantics of a program involves the overall meaning of it or its funtion i.e. what it does (not how it does it). The syntax of code describes how symbols may be combined independent of their meaning.

Search for "Models of Computation" on: Google | Kelkoo | Amazon | eBay (UK) | eBay (US)

Search for "Models of Computation" on the rest of Computing Students: Models of Computation