Search For:

Displaying 1-15 out of 15 total
Good Ideas, through the Looking Glass
Found in: Computer
By Niklaus Wirth
Issue Date:January 2006
pp. 28-39
Computing's history has been driven by many good and original ideas, but a few turned out to be less brilliant than they first appeared to be.
Hardware Compilation: Translating Programs into Circuits
Found in: Computer
By Niklaus Wirth
Issue Date:June 1998
pp. 25-31
Automatically translating a program specified in a programming language into a digital circuit is an idea of long-standing interest. Thus far, the concept has appeared to be an uneconomical method of largely academic, but hardly practical, interest. It has...
A Plea for Lean Software
Found in: Computer
By Niklaus Wirth
Issue Date:February 1995
pp. 64-68
Memory requirements of today's workstations typically jump substantially--from several to many megabytes--whenever there's a new software release. When demand surpasses capacity, it's time to buy add-on memory. When the system has no more extensibility, it...
An assessment of the programming language pascal
Found in: IEEE Transactions on Software Engineering
By Niklaus Wirth
Issue Date:June 1975
pp. 192-198
The programming language Pascal is assessed in the light of "reliable programming" and with the background of five years of experience with the language. Some features are selected to point out remaining problems, either inherent or specific, fro...
Modula-2 and Oberon
Found in: Proceedings of the third ACM SIGPLAN conference on History of programming languages (HOPL III)
By Niklaus Wirth
Issue Date:June 2007
pp. 3-es
This is an account of the development of the languages Modula-2 and Oberon. Together with their ancestors ALGOL 60 and Pascal they form a family called Algol-like languages. Pascal (1970) reflected the ideas of structured programming, Modula-2 (1979) added...
Computing science education: the road not taken
Found in: Proceedings of the 7th annual conference on Innovation and technology in computer science education (ITiCSE'02)
By Niklaus Wirth
Issue Date:June 2002
pp. 125-180
In computer science, an expected outcome of a student's education is programming skill. This working group investigated the programming competency students have as they complete their first one or two courses in computer science. In order to explore option...
From programming language design to computer construction
Found in: Communications of the ACM
By Niklaus Wirth
Issue Date:February 1985
pp. 160-164
From NELIAC (via ALGOL 60) to Euler and ALGOL W, to Pascal and Modula-2, and ultimately Lilith, Wirth's search for an appropriate formalism for systems programming yields intriguing insights and surprising results.
PL360, a Programming Language for the 360 Computers
Found in: Journal of the ACM (JACM)
By Niklaus Wirth
Issue Date:January 1968
pp. 37-74
A programming language for the IBM 360 computers and aspects of its implementation are described. The language, called PL360, provides the facilities of a symbolic machine language, but displays a structure defined by a recursive syntax. PL360 was designed...
A note on “Program structures for parallel processing”
Found in: Communications of the ACM
By Niklaus Wirth
Issue Date:May 1966
pp. 320-321
A computer-oriented method for processing and communicating numerical data is described. The Instrument Reliability Factors (IRF), which exactly define the limits of reliability of each measured item of information, are used to compute the Maximum Permitte...
EULER: a generalization of ALGOL, and its formal definition: Part II
Found in: Communications of the ACM
By Helmut Weber, Niklaus Wirth
Issue Date:February 1966
pp. 89-99
In this section the algorithmic language EULER is described first informally and then formally by its syntax and semantics. An attempt has been made to generalize and extend some of the concepts of ALGOL, thus creating a language which is simpler and yet m...
Algorithm 265: find precedence functions [L2]
Found in: Communications of the ACM
By Niklaus Wirth
Issue Date:October 1965
pp. 604-605
A special operator calculus developed by Hartley in 1956 together with a new mapping scheme has been found to be efficient in programming analysis of variance for multifactor experiments. The operator calculus and the mapping scheme are described in detail...
Automatic grading programs
Found in: Communications of the ACM
By George E. Forsythe, Niklaus Wirth
Issue Date:May 1965
pp. 275-278
The secondary key retrieval method involves the preparation of secondary storage lists from primary data records. Search requests are satisfied by logical operations on appropriate lists, producing a complete set of addresses of primary records relevant to...
Certification of algorithm 146: Multiple integration
Found in: Communications of the ACM
By Niklaus Wirth
Issue Date:May 1964
pp. 296
A version of a software-hardware system for the purpose of facilitating the programming and analysis of well-formulated problems is described. A modified Flexowriter is used to generate computer-acceptable input when equations or computable requests are ty...
A generalization of ALGOL
Found in: Communications of the ACM
By Niklaus Wirth
Issue Date:September 1963
pp. 547-554
A pilot version of the compiler MIRFAC, now in the operation, is described. The chief features of the system, which is intended for the solution of scientific problems, are the presentation of mathematical formulas entirely in standard textbook notation. T...
A syntactic description of BC NELIAC
Found in: Communications of the ACM
By H. D. Huskey, Niklaus Wirth, Ralph Love
Issue Date:July 1963
pp. 367-375
Descriptive geometry consists of procedures originally designed to solve 3-space geometry problems by graphical constructions and measurement instead of by computation. However, in addition to this it unifies and simplifies the approach to many such proble...