Simula

Short description: Early object-oriented programming language

Simula

Paradigms| Multi-paradigm: procedural, imperative, structured, object-oriented
Family| ALGOL
Designed by| Ole-Johan Dahl
Developer| Kristen Nygaard
First appeared| 1962; 61 years ago (1962)
Stable release|

Simula 67, Simula I

Typing discipline| Static, nominative
Scope| Lexical
Implementation language| ALGOL 60 (primarily; some components Simscript)
OS| Unix-like, Windows, z/OS, TOPS-10, MVS
Website| www.simula67.info
Influenced by
ALGOL 60, Simscript
Influenced
BETA, CLU, Eiffel, Emerald, Pascal, Smalltalk, and many other object-oriented programming languages

Simula is the name of two simulation programming languages, Simula I and Simula 67, developed in the 1960s at the Norwegian Computing Center in Oslo, by Ole-Johan Dahl and Kristen Nygaard. Syntactically, it is an approximate superset of ALGOL 60,[1]:1.3.1 and was also influenced by the design of Simscript.[2]

Simula 67 introduced objects,[1]:2, 5.3 classes,[1]:1.3.3, 2 inheritance and subclasses,[1]:2.2.1 virtual procedures,[1]:2.2.3 coroutines,[1]:9.2 and discrete event simulation,[1]:14.2 and featured garbage collection.[1]:9.1 Other forms of subtyping (besides inheriting subclasses) were introduced in Simula derivatives.

Simula is considered the first object-oriented programming language. As its name suggests, the first Simula version by 1962 was designed for doing simulations; Simula 67 though was designed to be a general-purpose programming language[3] and provided the framework for many of the features of object-oriented languages today.

Simula has been used in a wide range of applications such as simulating very-large-scale integration (VLSI) designs, process modeling, communication protocols, algorithms, and other applications such as typesetting, computer graphics, and education. The influence of Simula is often understated, and Simula-type objects are reimplemented in C++, Object Pascal, Java, C#, and many other languages. Computer scientists such as Bjarne Stroustrup, creator of C++, and James Gosling, creator of Java, have acknowledged Simula as a major influence.[4]

## Contents

* 1 History
* 2 Sample code
* 2.1 Minimal program
* 2.2 Classic Hello world
* 2.3 Classes, subclasses and virtual procedures
* 2.4 Call by name
* 2.5 Simulation
* 3 Notes
* 4 Sources
* 5 Further reading
* 6 External links

## History

The following account is based on Jan Rune Holmevik's historical essay.[5][6]

Kristen Nygaard started writing computer simulation programs in 1957. Nygaard saw a need for a better way to describe the heterogeneity and the operation of a system. To go further with his ideas on a formal computer language for describing a system, Nygaard realized that he needed someone with more computer programming skills than he had. Ole-Johan Dahl joined him on his work January 1962. The decision of linking the language up to ALGOL 60 was made shortly after. By May 1962, the main concepts for a simulation language were set. SIMULA I was born, a special purpose programming language for simulating discrete event systems.

Kristen Nygaard was invited to visit the Eckert–Mauchly Computer Corporation late May 1962 in connection with the marketing of their new UNIVAC 1107 computer. At that visit, Nygaard presented the ideas of Simula to Robert Bemer, the director of systems programming at Univac. Bemer was a great ALGOL fan and found the Simula project compelling. Bemer was also chairperson of a session at the second international conference on information processing hosted by International Federation for Information Processing (IFIP). He invited Nygaard, who presented the paper "SIMULA – An Extension of ALGOL to the Description of Discrete-Event Networks".

The Norwegian Computing Center got a UNIVAC 1107 in August 1963 at a considerable discount, on which Dahl implemented the SIMULA I under contract with UNIVAC. The implementation was based on the UNIVAC ALGOL 60 compiler. SIMULA I was fully operational on the UNIVAC 1107 by January 1965. In the following few years, Dahl and Nygaard spent a lot of time teaching Simula. Simula spread to several countries around the world and SIMULA I was later implemented on other computers including the Burroughs B5500 and the Russian Ural-16.

In 1966 C. A. R. Hoare introduced the concept of record class construct, which Dahl and Nygaard extended with the concept of prefixing and other features to meet their requirements for a generalized process concept. Dahl and Nygaard presented their paper on Class and Subclass declarations at the IFIP Working Conference on simulation languages in Oslo, May 1967. This paper became the first formal definition of Simula 67. In June 1967, a conference was held to standardize the language and initiate a number of implementations. Dahl proposed to unify the type and the class concept. This led to serious discussions, and the proposal was rejected by the board. Simula 67 was formally standardized on the first meeting of the Simula Standards Group (SSG) in February 1968.

Pages from the DECsystem-10 SIMULA Language Handbook, as published by the Swedish National Defence Research Institute

Simula was influential in the development of Smalltalk and later object-oriented programming languages. It also helped inspire the actor model of concurrent computation although Simula only supports coroutines and not true concurrency.[7]

In the late sixties and the early seventies, there were four main implementations of Simula:

* UNIVAC 1100 by Norwegian Computing Center (NCC)
* System/360 and System/370 by NCC
* CDC 3000 by University of Oslo's Joint Computer Installation at Kjeller
* TOPS-10 by Swedish National Defence Research Institute (FOA)

These implementations were ported to a wide range of platforms. The TOPS-10 implemented the concept of public, protected, and private member variables and procedures, that later was integrated into Simula Standard in 1986.

Simula Standard 1986 is the latest standard and is ported to a wide range of platforms. There are mainly four implementations:

* Simula AS
* Lund Simula
* GNU Cim[8]
* Portable Simula Revisited[9]

In November 2001, Dahl and Nygaard were awarded the IEEE John von Neumann Medal by the Institute of Electrical and Electronics Engineers "For the introduction of the concepts underlying object-oriented programming through the design and implementation of SIMULA 67". In April 2002, they received the 2001 A. M. Turing Award by the Association for Computing Machinery (ACM), with the citation: "For ideas fundamental to the emergence of object oriented programming, through their design of the programming languages Simula I and Simula 67." Dahl and Nygaard died in June and August of that year, respectively, [10] before the ACM Turing Award Lecture[11] that was scheduled to be delivered at the November 2002 OOPSLA conference in Seattle.

Simula Research Laboratory is a research institute named after the Simula language, and Nygaard held a part-time position there from the opening in 2001. The new Computer Science building at the University of Oslo is named Ole Johan Dahl's House, in Dahl's honour, and the main auditorium is named Simula.

## Sample code

### Minimal program

The empty computer file is the minimal program in Simula, measured by the size of the source code. It consists of one thing only; a dummy statement.

However, the minimal program is more conveniently represented as an empty block:

Begin
End;

It begins executing and immediately terminates. The language lacks any return value from the program.

### Classic Hello world

An example of a Hello world program in Simula:

Begin
OutText ("Hello, World!");
Outimage;
End;

Simula is case-insensitive.

### Classes, subclasses and virtual procedures

A more realistic example with use of classes,[1]:1.3.3, 2 subclasses[1]:2.2.1 and virtual procedures:[1]:2.2.3

Begin
Class Glyph;
Virtual: Procedure print Is Procedure print;;
Begin
End;

Glyph Class Char (c);
Character c;
Begin
Procedure print;
OutChar(c);
End;

Glyph Class Line (elements);
Ref (Glyph) Array elements;
Begin
Procedure print;
Begin
Integer i;
For i:= 1 Step 1 Until UpperBound (elements, 1) Do
elements (i).print;
OutImage;
End;
End;

Ref (Glyph) rg;
Ref (Glyph) Array rgs (1 : 4);

! Main program;
rgs (1):- New Char ('A');
rgs (2):- New Char ('b');
rgs (3):- New Char ('b');
rgs (4):- New Char ('a');
rg:- New Line (rgs);
rg.print;
End;

The above example has one super class (Glyph) with two subclasses (`Char` and `Line`). There is one virtual procedure with two implementations. The execution starts by executing the main program. Simula lacks the concept of abstract classes, since classes with pure virtual procedures can be instantiated. This means that in the above example, all classes can be instantiated. Calling a pure virtual procedure will however produce a run-time error.

### Call by name

Simula supports call by name[1]:8.2.3 so the Jensen's Device can easily be implemented. However, the default transmission mode for simple parameter is call by value, contrary to ALGOL which used call by name. The source code for the Jensen's Device must therefore specify call by name for the parameters when compiled by a Simula compiler.

Another much simpler example is the summation function [math]\displaystyle{ \sum }[/math] which can be implemented as follows:

Real Procedure Sigma (k, m, n, u);
Name k, u;
Integer k, m, n; Real u;
Begin
Real s;
k:= m;
While k <= n Do Begin s:= s + u; k:= k + 1; End;
Sigma:= s;
End;

The above code uses call by name for the controlling variable (k) and the expression (u). This allows the controlling variable to be used in the expression.

Note that the Simula standard allows for certain restrictions on the controlling variable in a for loop. The above code therefore uses a while loop for maximum portability.

The following:

[math]\displaystyle{ Z = \sum_{i=1}^{100}{1 \over (i + a)^2} }[/math]

can then be implemented as follows:

Z:= Sigma (i, 1, 100, 1 / (i + a) ** 2);

### Simulation

Simula includes a simulation[1]:14.2 package for doing discrete event simulations. This simulation package is based on Simula's object-oriented features and its coroutine[1]:9.2 concept.

Sam, Sally, and Andy are shopping for clothes. They must share one fitting room. Each one of them is browsing the store for about 12 minutes and then uses the fitting room exclusively for about three minutes, each following a normal distribution. A simulation of their fitting room experience is as follows:

Simulation Begin
Class FittingRoom; Begin
Ref (Head) door;
Boolean inUse;
Procedure request; Begin
If inUse Then Begin
Wait (door);
door.First.Out;
End;
inUse:= True;
End;
Procedure leave; Begin
inUse:= False;
Activate door.First;
End;
door:- New Head;
End;

Procedure report (message); Text message; Begin
OutFix (Time, 2, 0); OutText (": " & message); OutImage;
End;

Process Class Person (pname); Text pname; Begin
While True Do Begin
Hold (Normal (12, 4, u));
report  (pname & " is requesting the fitting room");
fittingroom1.request;
report (pname & " has entered the fitting room");
Hold (Normal (3, 1, u));
fittingroom1.leave;
report (pname & " has left the fitting room");
End;
End;

Integer u;
Ref (FittingRoom) fittingRoom1;

fittingRoom1:- New FittingRoom;
Activate New Person ("Sam");
Activate New Person ("Sally");
Activate New Person ("Andy");
Hold (100);
End;

The main block is prefixed with `Simulation` for enabling simulation. The simulation package can be used on any block and simulations can even be nested when simulating someone doing simulations.

The fitting room object uses a queue (`door`) for getting access to the fitting room. When someone requests the fitting room and it's in use they must wait in this queue (`Wait (door)`). When someone leaves the fitting room the first one (if any) is released from the queue (`Activate door.first`) and accordingly removed from the door queue (`door.First.Out`).

Person is a subclass of `Process` and its activity is described using hold (time for browsing the store and time spent in the fitting room) and calls procedures in the fitting room object for requesting and leaving the fitting room.

The main program creates all the objects and activates all the person objects to put them into the event queue. The main program holds for 100 minutes of simulated time before the program terminates.

## Notes

1. ↑ 1.00 1.01 1.02 1.03 1.04 1.05 1.06 1.07 1.08 1.09 1.10 1.11 1.12 1.13 Dahl, Ole-Johan; Myhrhaug, Bjørn; Nygaard, Kristen (1970). ﻿Common Base Language﻿ (Report). Norwegian Computing Center. http://www.edelweb.fr/Simula/#7. Retrieved 17 November 2020.
2. ↑ Nygaard, Kristen (1978). "The Development of the Simula Languages". https://hannemyr.com/cache/knojd_acm78.pdf. "The development of .. SIMULA I and SIMULA 67... were influenced by the design of SIMSCRIPT ..."
3. ↑ Kristen Nygaard and Ole-Johan Dahl. 1978. The development of the SIMULA languages. History of programming languages. Association for Computing Machinery, New York, NY, USA, 439–480. DOI:https://doi.org/10.1145/800025.1198392
4. ↑ Wong, William. "Before C, What Did You Use?". http://www.electronicdesign.com/embedded-revolution/c-what-did-you-use.
5. ↑ Holmevik, Jan Rune (1994). "Compiling Simula: A historical study of technological genesis". IEEE Annals of the History of Computing 16 (4): 25–37. doi:10.1109/85.329756. http://www.idi.ntnu.no/grupper/su/publ/simula/holmevik-simula-ieeeannals94.pdf. Retrieved 12 May 2010.
6. ↑ Holmevik, Jan Rune. "Compiling Simula". Oslo, Norway: Institute for Studies in Research and Higher Education. http://heim.ifi.uio.no/~cim/sim_history.html.
7. ↑ Lehrmann Madsen, Ole (2014). "Building Safe Concurrency Abstractions". in Agha, Gul; Igarashi, Atsushi; Kobayashi, Naoki et al.. Concurrent Objects and Beyond. Lecture Notes in Computer Science. 8665. Berlin: Springer. pp. 68. doi:10.1007/978-3-662-44471-9. ISBN 978-3-662-44471-9.
8. ↑ "GNU Cim". https://www.gnu.org/software/cim/.
9. ↑ "Portable Simula Revisited". https://portablesimula.github.io/github.io/.
10. ↑ "ACM Ole-Johan Dahl and Kristen Nygaard - Obituary". Acm.org. http://www.acm.org/announcements/turing_obit.html.
11. ↑ "ACM Turing Award Lectures". Informatik.uni-trier.de. http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html.

## Sources

* Sylvester, Peter. "IBM System 360/370 Compiler and Historical Documentation". http://www.edelweb.eu/Simula/.

## Further reading

* Pooley, Rob (1987), An Introduction to Programming in Simula, Alfred Waller Ltd, ISBN 0632016116, http://www.macs.hw.ac.uk/~rjp/bookhtml/

## External links

* (last working version at archive.org, accessed 2022-02-26)
* on GitHub

* v
* t
* e

ALGOL programming

Implementations|

| Technical
standards|

* ALGOL 58
* ALGOL 60
* ALGOL 68

|

Dialects|

* ABC ALGOL
* ALCOR
* ALGOL N
* ALGOL W
* ALGOL X
* Burroughs ALGOL
* Dartmouth ALGOL 30
* DASK ALGOL
* DG/L
* Elliott ALGOL
* Executive Systems Problem Oriented Language (ESPOL)
* Kidsgrove Algol
* Mary
* S-algol, PS-algol, Napier88
* Small Machine ALGOL Like Language (SMALL)
* SMIL ALGOL

Community|

| Organizations|

| Professional
associations|

* ALCOR Group
* Association for Computing Machinery (ACM)
* International Federation for Information Processing (IFIP) IFIP Working Group 2.1

|

Business|

* Burroughs Corporation
* Elliott Brothers
* Regnecentralen

Education|

* Case Institute of Technology
* University of Edinburgh
* University of St Andrews
* Manchester University
* Massachusetts Institute of Technology (MIT)
* Society of Applied Mathematics and Mechanics (GAMM)

People|

| ALGOL 58|

* John Backus
* Hermann Bottenbruch
* Charles Katz
* Alan Perlis
* Heinz Rutishauser
* Klaus Samelson
* Joseph Henry Wegstein

|

ALGOL 60|

* Backus+
* Roland Carl Backhouse
* Friedrich L. Bauer
* Richard Bird
* Stephen R. Bourne
* Robert Dewar
* Edsger W. Dijkstra
* Andrey Ershov
* Robert W. Floyd
* Jeremy Gibbons
* Julien Green
* David Gries
* Eric Hehner
* Tony Hoare
* Katz+
* Peter Landin
* Tom Maibaum
* Conor McBride
* John McCarthy
* Carroll Morgan
* Peter Naur
* Maurice Nivat
* Perlis+
* Brian Randell
* Rutishauser
* Samelson+
* Jacob T. Schwartz
* Micha Sharir
* David Turner
* Bernard Vauquois
* Eiiti Wada
* Wegstein+
* Adriaan van Wijngaarden
* Michael Woodger
* \+ = full name and link in prior ALGOL version above

ALGOL 68|

* Bauer+
* Dijkstra+
* Gerhard Goos
* Hoare+
* Cornelis H. A. Koster
* Peter Landin
* Charles H. Lindsey
* Barry J. Mailloux
* McCarthy+
* Lambert Meertens
* Naur+
* John E. L. Peck
* Willem van der Poel
* Brian Randell
* Douglas T. Ross
* Samelson+
* Michel Sintzoff
* van Wijngaarden
* Niklaus Wirth
* Woodger+
* Nobuo Yoneda
* \+ = full name and link in prior ALGOL version above

* Hal Abelson
* Tony Brooker
* Jørn Jensen
* Ron Morrison
* John C. Reynolds

Other|

* ALGOL Bulletin
* Jensen's Device

* Category
* Category

* v
* t
* e

Programming languages

* Comparison
* Timeline
* History

* APL
* Assembly
* BASIC
* C
* C++
* C#
* COBOL
* Elixir
* Fortran
* Go
* Groovy
* Haskell
* Java
* JavaScript (JS)
* Julia
* Kotlin
* Lisp
* Lua
* MATLAB
* Objective-C
* OCaml
* Pascal
* Perl
* PHP
* Python
* R
* Ruby
* Rust
* Scala
* Shell
* Smalltalk
* Swift
* TypeScript
* Visual Basic .NET (VB.NET)
* more...

* Category
* Lists
* Alphabetical
* Categorical
* Generational
* Non-English-based

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Simula. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Simula&oldid=3170727"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template