Augmented Primitive Data Types of Programming Language

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of “review scheme” is defined, which is like the concept of “bypassing” trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on “stroke-operation” (pointer dereference), which was hardware implemented in the command system of computer “Kyiv”. Group operations of modernization of computer “Kyiv” addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer “Kyiv”, due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer “Kyiv” allow direct access to the i-th element of the “list” by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.

Download Full-text

Fortran 90: A simple programming language

Introduction to Computational Economics Using Fortran ◽

10.1093/oso/9780198804390.003.0004 ◽

2018 ◽

Author(s):

Hans Fehr ◽

Fabian Kindermann

Keyword(s):

Programming Language ◽

Object Oriented ◽

Object Oriented Programming ◽

Translation System ◽

Data Types ◽

Dynamic Memory ◽

Fortran Language ◽

Fortran 90 ◽

Popular Language ◽

Standard Fortran

Before diving into the art of solving economic problems on a computer, we want to give a short introduction into the syntax and semantics of Fortran 90. As describing all features of the Fortran language would probably fill some hundred pages, we concentrate on the basic features that will be needed to follow the rest of this textbook. Nevertheless, there are various Fortran tutorials on the Internet that can be used as complementary literature. Fortran is pretty old; it is actually considered the first known higher programming language. Going back to a proposal made by John W. Backus, an IBM programmer, in 1953, the term Fortran is derived from The IBM Formula Translation System. Before the release of the first Fortran compiler in April 1957, people used to use assembly languages. The introduction of a higher programming language compiler tremendously reduced the number of code lines needed to write a program. Therefore, the first release of the Fortran programming language grew pretty fast in popularity. From 1957 on, several versions followed the initial Fortran version, namely FORTRAN II and FORTRAN III in 1958, and FORTRAN IV in 1961. In 1966, the American Standards Association (now known as the ANSI) approved a standardized American Standard Fortran. The programming language defined on this standard was called FORTRAN 66. Approving an updated standard in 1977, the ANSI paved the way for a new version of Fortran known as FORTRAN 77. This version became popular in computational economics during the late 80s and early 90s. More than 13 years later, the Fortran 90 standard was released by both the International Organization for Standardization (ISO) and ANSI consecutively. With Fortran 90, the fixed format standard was exchanged by a free format standard and, in addition, many new features like modules, recursive procedures, derived data types, and dynamic memory allocation made the language much more flexible. From Fortran 90 on, there has only been one major revision, in 2003, which introduced object oriented programming features into the Fortran language. However, as object-oriented programming will not be needed and Fortran 90 is by far the more popular language, we will focus on the 1990 version in this book.

Download Full-text

The ins and outs of Clean I/O

Journal of Functional Programming ◽

10.1017/s0956796800001258 ◽

1995 ◽

Vol 5 (1) ◽

pp. 81-110 ◽

Cited By ~ 28

Author(s):

Peter Achten ◽

Rinus Plasmeijer

Keyword(s):

Programming Languages ◽

Programming Language ◽

Functional Programming ◽

Data Types ◽

Spreadsheet Program ◽

Functional Programming Languages ◽

Hard Time ◽

Functional Programming Language ◽

Algebraic Data Types ◽

High Level

AbstractFunctional programming languages have banned assignment because of its undesirable properties. The reward of this rigorous decision is that functional programming languages are side-effect free. There is another side to the coin: because assignment plays a crucial role in Input/Output (I/O), functional languages have a hard time dealing with I/O. Functional programming languages have therefore often been stigmatised as inferior to imperative programming languages because they cannot deal with I/O very well. In this paper, we show that I/O can be incorporated in a functional programming language without loss of any of the generally accepted advantages of functional programming languages. This discussion is supported by an extensive account of the I/O system offered by the lazy, purely functional programming language Clean. Two aspects that are paramount in its I/O system make the approach novel with respect to other approaches. These aspects are the technique of explicit multiple environment passing, and the Event I/O framework to program Graphical User I/O in a highly structured and high-level way. Clean file I/O is as powerful and flexible as it is in common imperative languages (one can read, write, and seek directly in a file). Clean Event I/O provides programmers with a high-level framework to specify complex Graphical User I/O. It has been used to write applications such as a window-based text editor, an object based drawing program, a relational database, and a spreadsheet program. These graphical interactive programs are completely machine independent, but still obey the look-and-feel of the concrete window environment being used. The specifications are completely functional and make extensive use of uniqueness typing, higher-order functions, and algebraic data types. Efficient implementations are present on the Macintosh, Sun (X Windows under Open Look) and PC (OS/2).

Download Full-text

Refinement and retrenchment for programming language data types

Formal Aspects of Computing ◽

10.1007/s00165-005-0073-x ◽

2005 ◽

Vol 17 (4) ◽

pp. 423-442 ◽

Cited By ~ 2

Author(s):

Bernhard Beckert ◽

Steffen Schlager

Keyword(s):

Programming Language ◽

Data Types ◽

Language Data

Download Full-text

Parametric polymorphism and operational equivalence

Mathematical Structures in Computer Science ◽

10.1017/s0960129500003066 ◽

2000 ◽

Vol 10 (3) ◽

pp. 321-359 ◽

Cited By ~ 78

Author(s):

ANDREW M. PITTS

Keyword(s):

Programming Language ◽

Functional Programming ◽

Closure Operator ◽

Lambda Calculus ◽

Logical Relation ◽

Data Types ◽

Mathematical Properties ◽

Parametric Polymorphism ◽

Operational Behaviour

Studies of the mathematical properties of impredicative polymorphic types have for the most part focused on the polymorphic lambda calculus of Girard–Reynolds, which is a calculus of total polymorphic functions. This paper considers polymorphic types from a functional programming perspective, where the partialness arising from the presence of fixpoint recursion complicates the nature of potentially infinite (‘lazy’) data types. An approach to Reynolds' notion of relational parametricity is developed that works directly on the syntax of a programming language, using a novel closure operator to relate operational behaviour to parametricity properties of types. Working with an extension of Plotkin's PCF with ∀-types, lazy lists and existential types, we show by example how the resulting logical relation can be used to prove properties of polymorphic types up to operational equivalence.

Download Full-text

Towards a quantum programming language

Mathematical Structures in Computer Science ◽

10.1017/s0960129504004256 ◽

2004 ◽

Vol 14 (4) ◽

pp. 527-586 ◽

Cited By ~ 192

Author(s):

PETER SELINGER

Keyword(s):

Programming Language ◽

Quantum Algorithms ◽

Denotational Semantics ◽

Quantum Circuit ◽

Structured Data ◽

Data Types ◽

Simple Quantum ◽

Recursive Procedures ◽

Quantum Programming ◽

High Level

We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and semantics of a simple quantum programming language with high-level features such as loops, recursive procedures, and structured data types. The language is functional in nature, statically typed, free of run-time errors, and has an interesting denotational semantics in terms of complete partial orders of superoperators.

Download Full-text

Python programming language: practicum

10.12737/textbook_5cb5ca35aaa7f5.89424805 ◽

2019 ◽

Author(s):

Роман Жуков ◽

Roman Zhukov

Keyword(s):

Programming Languages ◽

Programming Language ◽

Undergraduate Students ◽

Object Oriented Programming ◽

Federal State ◽

Full Time ◽

Data Types ◽

Python Programming Language ◽

State Educational ◽

Python Programming

The tutorial is devoted to the theoretical and practical study of the modern widely used programming language Python. The manual consists of 5 chapters, which consistently addressed issues such as the history of programming languages, features and basic elements of the Python programming language (data types; instructions, functions, modules; object-oriented programming; development of graphical interfaces). The material is presented compactly while maintaining the necessary rigor, algorithmicity and detailed elaboration of the basic concepts in accordance with the working program of the discipline "Computer workshop". Meets the requirements of the Federal state educational standard of higher education of the last generation. For undergraduate students full-time and part-time training areas "Business Informatics", as well as all those interested in programming.

Download Full-text