Quantum Programming Made Easy

We present IQu, namely a quantum programming language that extends Reynold's Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines imperative programming with high-order features, mediated by a simple type theory. IQu mildly merges its quantum features with the classical programming style that we can experiment through Idealized Algol, the aim being to ease a transition towards the quantum programming world. The proposed extension is done along two main directions. First, IQu makes the access to quantum co-processors by means of quantum stores. Second, IQu includes some support for the direct manipulation of quantum circuits, in accordance with recent trends in the development of quantum programming languages. Finally, we show that IQu is quite effective in expressing well-known quantum algorithms.Comment: In Proceedings Linearity-TLLA 2018, arXiv:1904.0615

On the basis for ELF - An Extensible Language Facility

Computer language for data processing and information retrieva

A pascal compiler for PDP 11 minicomputers

In this paper the development of a cross-compiler running on the central computing facility is described. The compiler transforms PASCAL source code into object code for the PDP 11 family. The arguments for higher level languages on minicomputers and the choice made for PASCAL are discussed. It is shown that only a minor effort in terms of manpower is required if such a development is based on an existing compiler that is suited to the purpose of adaptation. Even without large amounts of optimization the code produced is both compact and efficient. Some attention is paid to requirements that should be fulfilled in portable compilers. The paper ends with a discussion of some strong points and weak points of the PDP 11 architecture

Fifty years of Hoare's Logic

We present a history of Hoare's logic.Comment: 79 pages. To appear in Formal Aspects of Computin

Data types

A Mathematical interpretation is given to the notion of a data type. The main novelty is in the generality of the mathematical treatment which allows procedural data types and circularly defined data types. What is meant by data type is pretty close to what any computer scientist would understand by this term or by data structure, type, mode, cluster, class. The mathematical treatment is the conjunction of the ideas of D. Scott on the solution of domain equations (Scott (71), (72) and (76)) and the initiality property noticed by the ADJ group (ADJ (75), ADJ (77)). The present work adds operations to the data types proposed by Scott and generalizes the data types of ADJ to procedural types and arbitrary circular type definitions. The advantages of a mathematical interpretation of data types are those of mathematical semantics in general : throwing light on some ill-understood constructs in high-level programming languages, easing the task of writing correct programs and making possible proofs of correctness for programs or implementations"

Methods of regularization for computing orbits in celestial mechanics

Numerical and analytical methods for orbit computation in celestial mechanics during and beyond collision by introduction of regularized coordinate