Showing papers on "Functional logic programming published in 1971"
TL;DR: An analytical review of mathematical programming models that have been proposed as aids to the related problems of resource allocation and project selection in RD built-in assumptions; ease of computation; usefulness of outputs; versatility of application.
Abstract: This paper presents an analytical review of mathematical programming models that have been proposed as aids to the related problems of resource allocation and project selection in RD built-in assumptions; ease of computation; usefulness of outputs; versatility of application.
60 citations
TL;DR: A class of models for characterizing computations in terms of the data structures to which they give rise during execution is introduced and how such models can be used to characterize automata, digital computers and programming languages is shown.
Abstract: This paper introduces a class of models (information structure models) for characterizing computations in terms of the data structures to which they give rise during execution, shows how such models can be used to characterize automata, digital computers and programming languages, considers in some detail the data structures generated during the execution of programs in block structure languages, develops a model for a non-block structure language (SNOBOL 4) and indicates how information structure models may be used in the semantic definition and formal characterization of programming languages. Sections 1 and 2 discuss the reasons for studying the relation between data structures and programming languages, section 3 introduces the notion of an information structure model and considers the classification of interpreters, and section 4 shows how automata, computers and programming languages may be characterized as sequential information structure models. Section 5 underlines the importance of introducing cells and references as semantic primitives of computational models. Section 6 develops models of implementation of block structure languages, section 7 considers the limitations of stack structure, and section 8 considers the hardware realization of block structure implementation of the Burroughs B6500. Section 9 develops an information structure model for the non-block structure language SNOBOL 4, while section 10 briefly discusses information structure models of language definition and the use of information structure models in proofs that programs have certain property. A final subsection considers the relative merits of axiomatic definition versus implementation-dependent definition of programming languages.
55 citations
TL;DR: This paper presents a series of ten mini-languages, each of which exposes salient features found in existing programming languages, and serves as a set of test cases for methods of language implementation or formal definition.
Abstract: The proliferation of programming languages has raised many issues of language design, definition, and implementation. This paper presents a series of ten mini-languages, each of which exposes salient features found in existing programming languages. The value of the mini-languages lies in their brevity of description and the isolation of important linguistic features: in particular, the notions of assignment, transfer of control, functions, parameter passing, type checking, data structures, string manipulation, and input/output. The mini-languages may serve a variety of uses: notably, as a pedagogical tool for teaching programming languages, as a subject of study for the design of programming languages, and as a set of test cases for methods of language implementation or formal definition.
42 citations
IBM1
TL;DR: The formal description methods introduced in this paper were related to the simple language SPL for explanation purposes and an extension to the execution control of the abstract interpreter was used in the formal description of PL/1.
Abstract: The formal description methods introduced in this paper were related to our simple language SPL for explanation purposes. Actually, the methods (i.e., abstract trees, predicates, state components, control trees, etc.) apply to all programming languages. However, some programming languages contain facilities that cannot be expressed using the methods described in this paper alone. For example, additional definitions are required to represent the multitasking facilities of PL/1. To solve this particular problem, an extension to the execution control of the abstract interpreter was used in the formal description of PL/1.
27 citations
Proceedings Article•
01 Jan 1971
19 citations
TL;DR: A new proof of the basic theorem of SPL's is offered to make the relationship between size and efficiency more revealing and to show that finitely often efficiency is the price of economy of size.
9 citations
01 Jan 1971
TL;DR: A programming language, “PS440”, is described which provides many of the advantages of higher level languages while at the same time maintaining some needed facilities of assembly language.
Abstract: The use of assembly language for the programming of basic software of a large operating system often proves inflexible and impractical. Writing the programs in assembly language is time-consuming and expensive. Furthermore, the programs are hard to read and difficult to modify. Nevertheless, assembly languages have facilities which must be preserved when higher level programming languages are to be used for basic software. A programming language, “PS440”, is described which provides many of the advantages of higher level languages while at the same time maintaining some needed facilities of assembly language.
01 Jan 1971
TL;DR: The Mixed Integer Programming Interface Subroutine System (MIPIS) as discussed by the authors is a set of programs written to facilitate the implementation of most known MIP algorithms in a common system environment.
Abstract: The Mixed Integer Programming Interface Subroutine System (MIPIS)* consists of a set of programs written to facilitate the implementation of most known MIP algorithms in a common system environment. This experimental system [3] makes no claim to overall (running time) efficiency since it utilizes the experimental, Fortran based linear programming (LP) code NYLPS (New York Scientific Center Linear programming System [7])* known to be less efficient than other commercially available LP codes (e.g. MPS/360, etc.) written in Assembly Language. NYLPS is an OS/360 extension of LPS/360 [8] which operates under DOS/360.The study and associated development of MIPIS was directed toward examining the manner in which MIP algorithms would be implemented, in a flexible environment, rather than toward implementing another MIP production code. It is hoped that this experiment will motivate designers to provide additional flexibility for building and extending the scope of future mathematical programming systems.
01 Jun 1971
TL;DR: This system was programmed entirely in Bliss, a high-level programming, language specifically designed for the writing of systems programs, which supports both Teletype and IBM/Datel terminals.
Abstract: : As part of the ongoing research program in conversational programming an APL system has been implemented for the PDP-10. As this system is to be a base for extensive study in conversational programming the system was programmed entirely in Bliss, a high-level programming, language specifically designed for the writing of systems programs. A few extensions to APL are included in this first version which supports both Teletype and IBM/Datel terminals.
TL;DR: The differences between programming languages and the traditional mathematical symbolisms are considered, some features of the development and application of programming languages are pointed out and some fundamental properties of a new approach to the construction of a universal algorithmic language are stated.
Abstract: THE differences between programming languages and the traditional mathematical symbolisms are considered, some features of the development and application of programming languages are pointed out and some fundamental properties of a new approach to the construction of a universal algorithmic language are stated.