Lilith section updated

I have added the repository by Jos Dreesen on Lilith and the Emulith emulator with a local copy.
Jos maintains a ftp with just the files, I made it available as web pages here with higher availability and easier viewing of images and videos.


My sites

Links to the sites on hansotten and sophiechermin domains
Main website, about electronic kits (my former Philips bouwdozen mainly) and my former LP collection and my Radio Bulletin articles 1977-1986.

My personal blog. Ramblings about what interests me, not directly related to one of the next websites.


About SBC computers, mainly 6502 CPU based such as KIM-1 and Elektor/Elektuur.


The computer language Pascal and other Niklaus Wirth languages history and  on small computers.



On Arduino, Raspberry Pi and ESP8266 IOT computing.



Photos and videos of our travels from the early years to the last!

Photo’s and descriptions of all sites we have visited (ruined sites and museums) of antquity (mainly greco-roman, some neolithic, some far east).


About my place of birth and city I lived most of my life.


Sophie’s blog about our trips and more


Objects I have for sale







Modern Object Pascal guide

Link to Quick Modern Object Pascal for Programmers

Michalis Kamburelis and contributors: Maciej Izak

There are many books and resources about Pascal out there, but too many of them talk about the old Pascal, without classes, units or generics.

So I wrote this quick introduction to what I call modern Object Pascal. Most of the programmers using it don’t really call it “modern Object Pascal”, we just call it “our Pascal”. But when introducing the language, I feel it’s important to emphasize that it’s a modern, object-oriented language. It evolved a lot since the old (Turbo) Pascal that many people learned in schools long time ago. Feature-wise, it’s quite similar to C++ or Java or C#.

  • It has all the modern features you expect — classes, units, interfaces, generics…
  • It’s compiled to a fast, native code,
  • It’s very type safe,
  • High-level but can also be low-level if you need it to be.

It also has excellent, portable and open-source compiler called the Free Pascal Compiler, . And an accompanying IDE (editor, debugger, a library of visual components, form designer) called Lazarus . Myself, I’m the creator of Castle Game Engine, , which is a cool portable 3D and 2D game engine using this language to create games on many platforms (Windows, Linux, MacOSX, Android, iOS, web plugin).

This introduction is mostly directed at programmers who already have experience in other languages. We will not cover here the meanings of some universal concepts, like “what is a class”, we’ll only show how to do them in Pascal.

See here!

Oberon Linux Revival

OLR is the Oberon System with Gadgets running natively on the Linux Kernel of X86, MIPS and ARM processors. It is a consolidation effort to make a single distribution from Linux Native Oberon, ARM Linux Oberon and MIPS Linux Oberon.

Basis of the system is the latest Alpha of PC Native Oberon of ETH Zürich. Main changes are the filesystem which is not based on OFS any more and a more direct display system. Object/symbol files are in olr/x86/ , olr/mips/ and olr/arm/ for X86, MIPS and ARM

Oxford Oberon CompilerA fairly portable compiler, runs on Windows/Ubuntu, Debian and Debian derivatives, OS X, Raspberry Pi. It uses the Objective Caml runtime, but is statically linked. A, checklist for Oberon-07 features/compatibility is available for tracking future planned support of Oberon-07.

Vishap Oberon CompilerA new, well maintained, and natively both 32-bit and 64-bit Oberon-2 compiler, which is highly portable. Runs on Linux x86/AMD64/ARM 4-7 including Raspberry Pi/OS X; FreeBSD). Untested on Windows. Voc also includes a simple Oberon-07 compiler. The compiler uses static linking, but a dynamic run-time has been discussed as a future possibility. The author also has a proprietary compiler he worked on at ETH, but which is not publically available.

Someday I want to try this out!

A case against the GOTO statement


A Case against the GO TO Statement.

by Edsger W.Dijkstra
Technological University
Eindhoven, The Netherlands

Since a number of years I am familiar with the observation that the quality of programmers is a decreasing function of the density of go to statements in the programs they produce. Later I discovered why the use of the go to statement has such disastrous effects and did I become convinced that the go to statement should be abolished from all “higher level” programming languages (i.e. everything except —perhaps— plain machine code). At that time I did not attach too much importance to this discovery; I now submit my considerations for publication because in very recent discussions in which the subject turned up, I have been urged to do so.

My first remark is that, although the programmer’s activity ends when he has constructed a correct program, the process taking place under control of his program is the true subject matter of his activity, for it is this process that has to effectuate the desired effect, it is this process that in its dynamic behaviour has to satisfy the desired specifications. Yet, once the program has been made, the “making” of the corresponding process is delegated to the machine.

My second remark is that our intellectual powers are rather geared to master static relations and that our powers to visualize processes evolving in time are relatively poorly developed. For that reason we should do (as wise programmers aware of our limitations) our utmost best to shorten the conceptual gap between the static program and the dynamic process, to make the correspondence between the program (spread out in text space) and the process (spread out in time) as trivial as possible.

Let us now consider how we can characterize the progress of a process. (You may think about this question in a very concrete manner: suppose that a process, considered as a time succession of actions, is stopped after an arbitrary action, what data do we have to fix in order that we can redo the process until that very same point?) If the program text is a pure concatenation of, say, assignment statements (for the purpose of this discussion regarded as the descriptions of single actions) it is sufficient to point in the program text to a point between two successive action descriptions. (In the absence of go to statements I can permit myself the syntactic ambiguity in the last three words of the previous sentence: if we parse them as “successive (action descriptions)” we mean successive in text space, if we parse as “(successive action) descriptions” we mean successive in time.) Let us call such a pointer to a suitable place in the text a “textual index”.

When we include conditional clauses (if B then A), alternative clauses (if B then A1 elseA2), choice clauses as introduced by C.A.R.Hoare (case[i] of (A1, A2,…..,An)) or conditional expressions as introduced by J. McCarthy (B1 → E1, B2 → E2,….., BnEn), the fact remains that the progress of the process remains characterized by a single textual index.

As soon as we include in our language procedures we must admit that a single textual index is no longer sufficient: in the case that a textual index points to the interior of a procedure body the dynamic progress is only characterized when we also give to which call of the procedure we refer. With the inclusion of procedures we can characterize the progress of the process via a sequence of textual indices, the length of this sequence being equal to the dynamic depth of procedure calling.

Let us now consider repetition clauses (like, while B repeat A or repeat A until B). Logically speaking, such clauses are now superfluous, because we can express repetition with the aid of recursive procedures. For reasons of realism I don’t wish to exclude them: on the one hand repetition clauses can be implemented quite comfortably with present day finite equipment, on the other hand the reasoning pattern known as “induction” makes us well equipped to retain our intellectual grasp on the processes generated by repetition clauses. With the inclusion of the repetition clauses textual indices are no longer sufficient to describe the dynamic progress of the process. With each entry into a repetition clauses, however, we can associate a so-called “dynamic index”, inexorably counting the ordinal number of the corresponding current repetition. As repetition clauses (just as procedure calls) may be applied nestedly, we find that now the progress of the process can always be uniquely characterized by a (mixed) sequence of textual and/or dynamic indices.

The main point is that the values of these indices are outside programmer’s control: they are generated (either by the write up of his program or by the dynamic evolution of the process) whether he wishes or not. They provide independent coordinates in which to describe the progress of the process.

Why do we need such independent coordinates? The reason is—and this seems to be inherent to sequential processes—that we can interpret the value of a variable only with respect to the progress of the process. If we wish to count the number, n say, of people in an initially empty room, we can achieve this by increasing n by 1 whenever we see someone entering the room; in the in-between moment that we have observed someone entering the room but have not yet performed the subsequent increase of n, its value equals the number of people in the room minus one!

The unbridled use of the go to statement has as an immediate consequence that it becomes terribly hard to find a meaningful set of coordinates in which to describe the process progress. Usually, people take into account as well the values of some well chosen variables, but this is out of the question because it is relative to the progress that the meaning of these values is to be understood! With the go to statement one can, of course, still describe the progress uniquely by a counter counting the number of actions performed since program start (viz. a kind of normalized clock). The difficulty is that such a coordinate, although unique, is utterly unhelpful: in such a coordinate system it becomes an extremely complicated affair to define all those points of progress where, say, n equals the number of persons in the room minus one!

The go to statement as it stands is just too primitive, it is too much an invitation to make a mess of one’s program. One can regard and appreciate the clauses considered as bridling its use. I do not claim that the clauses mentioned are exhaustive in the sense that they will satisfy all needs; but whatever clauses are suggested (e.g. abortion clauses) they should satisfy the requirement that a programmer independent coordinate system can be maintained to describe the process in a helpful and manageable way.

It is hard to end this article with a fair acknowledgement: am I to judge by whom my thinking has been influenced? It is fairly obvious that I am not uninfluenced by Peter Landin and Christopher Strachey, and that I do not regret their influence upon me. Finally I should like to record (as I remember it quite distinctly) how Heinz Zemanek at the pre-ALGOL meeting in early 1959 in Copenhagen quite explicitly expressed his doubts whether the go to statement should be treated on equal syntactic footing with the assignment statement. To a modest extent I blame myself for not having then drawn the consequences of his remark.

The remark about the undesirability of the go to statement is far from new. I remember having read the explicit recommendation to restrict the use of the go to statement to alarm exits, but I have not been able to trace it; presumably, it has been made by C.A.R. Hoare. In [1, Sec. 3.2.1] Wirth and Hoare together make a remark in the same direction in motivating the case construction: “Like the conditional, it mirrors the dynamic structure of a program more clearly than go to statements and switches, and it eliminates the need for introducing a large number of labels in the program.”

In [2] Guiseppe [sic] Jacopini seems to have proved the (logical) superfluousness of the go to statement. The exercise to translate an arbitrary flow diagram more or less mechanically into a jumpless one, however, is not to be recommended. Then the resulting flow diagram cannot be expected to be more transparent than the original one.


  1. Wirth, Niklaus, and Hoare, C.A.R. A contribution to the development of ALGOL. Comm. ACM 9 (June 1966), 413–432.
  2. Böhm, Corrado, and Jacopini, Guiseppe. Flow diagrams, Turing machines and languages with only two formation rules. Comm. ACM 9 (May 1966), 366–371.

HP 1000 Pascal

I worked at KSLA Shell Amsterdam labs 1980-1983. One of my projects was to develop a realtime system in Pascal.

Goal of the project was to emulate a TDC 2000 device, with only the public information supplied by Honeywell, in hardware and software.
The Honeywell TDC 2000/3000 is an advanced distributed control system. TDC 2000 was introduced in 1975.
To do this special hardware was developed (a 6809 micropocessor system) as a device driver in an HP1000 minicomputer to talk to the TDC2000 bus.
The HP1000 itself was running its own real time operating system RTE. The application I wrote, in HP1000 Pascal, was responsible for communication over the TDC2000 bus via this device driver, being a node in the TDC2000 system.

HP1000 Pascal was quite a good implementation of Standard Pascal. Via systems calls one could communicate with device drivers. The whole system, operating systen and application, was in the end burned into EPROMs as disk  (many 2716s!) so the machine could run diskless in harsh environments.

The program was a realtime application. And Shell wanted it to be in a higher level language and Pascal was en voque in the KSLA lab these days. I learned and discussed a lot with fellow engineers there about Pascal (Concurrent Pascal, Standard Pascal, Pascal Plus etc).

As a realtime applciation the standard layout was chosen: an init part and an endless main loop servicing the devices with commands over the bus and transmitting results over the bus with answers on queries.
I do remember the HP1000 was not the fastest machine. Since the response had to be realtime, I encountered several performance problems during the loop of the 1 second dutycycle available. One was a calculation of a real variable, a sinus value. Floating point was done in software, so that was a bottleneck. I solved that by at the init part calculating and storing in a table the sinus values in the resolution required and doing a table lookup in the main loop. It all worked out very well.