Preliminary report: international algebraic language

  title={Preliminary report: international algebraic language},
  author={Alan J. Perlis and Klaus Samelson},
  journal={Commun. ACM},
Editor's Notes: Although this method is not novel, it has been printed here to summarize for the benefit of a new generation of computer personnel. I t should be noted that : 1) This method seems advantageous if only a few significant figures are required. Otherwise the normal method, Log-Multiply-Antilog, is more desirable and faster in particular for higher order roots. These subroutines are normally required for other purposes anyway and space is not lost. 2) One immediately notices many… 

Pursuit of the Universal

It is argued that recent work on the complexity of model-checking for logics of strategic ability with resources offers the possibility of significant progress in the field, new verification approaches and tools, and the ability to verify the properties of a large, important class of autonomous system that were previously out of reach.

The extent of empirical evidence that could inform evidence-based design of programming languages : a systematic mapping study

There clearly are language design decisions for which empirical evidence regarding efficacy exists; they may be of some use to language designers, and several of them may be ripe for systematic reviewing.

A Computer Built with Relays and a Mechanical Memory, and ALGOL

ALGOL was formulated in Zurich in 1958, and this paper explores some of the reasons why this happened in Zurich and not in the USA, including the fact that the first computer on the continent, the Z4, was installed in Switzerland in 1950.

Structure and Use of ALGOL 60

An elaboration of the concepts of ALGOL 60 is given, mostly with the help of illustrative examples.

German Encounters of Logic and Programming (1948–1958), Featuring Three Readings of Turing Machines

The early days of German and Swiss programming have been integrated into computing folklore as part of the prehistory of ALGOL, but the encounters between logic and programming in these years are discussed.

Staking claims: a history of programming language design claims and evidence: a positional work in progress

Preliminary work which revisits the history of unsupported claims in programming language development by examining a number of language design papers confirms that unsupported claims have been around since the inception of higher level programming in the 1950s.

Compilation for two computers with NELIAC

NELIAC, a compiler based on ALGOL, was developed at the U. S. Navy Electronics Laboratory, San Diego, California, as a “bootstrap” compiler for the Remington Rand Univac COUNTESS computer. This

What’s in a name? Origins, transpositions and transformations of the triptych Algorithm -Code -Program

The purpose of this chapter is to focus on three connected and basic notions of computing, Algorithm Code Program, and to study their historical origins, their re-appropriations and transformations

In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming

  • François Bry
  • Computer Science
    Theory and Practice of Logic Programming
  • 2019
Reflective Predicate Logic is defined, a conservative extension of first-order logic, which provides a simple formalization of meta-programming.

Program Text, Programming Style, Programmer Labor

This article suggests that a syntactic feature common to all programming languages used today serves as a register of this logic of automation, leaving traces in code that are legible if one knows where to look.