Showing papers on "Functional logic programming published in 1969"

An axiomatic basis for computer programming

Abstract: In this paper an attempt is made to explore the logical foundations of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This involves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and practical, may follow from a pursuance of these topics.

Programming Languages: History and Fundamentals

Abstract: We may not be able to make you love reading, but programming languages history and fundamentals will lead you to love reading starting from now. Book is the window to open the new world. The world that you want is in the better stage and level. World will always guide you to even the prestige stage of the life. You know, this is some of how reading will give you the kindness. In this case, more books you read more knowledge you know, but it can mean also the bore is full.

Programming by action clusters

Abstract: The paper describes a programming discipline, aiming at the systematic construction of programs from given global requirements. The crucial step in the approach is the conversion of the global requirements into sets of action clusters (sequences of program statements), which are then used as building blocks for the final program. The relation of the approach to proof techniques and to programming languages is discussed briefly.

Computer Organization and Programming

Abstract: Computer organization and programming , Computer organization and programming , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی

A theory of programming languages

Abstract: syntax: application, abstraction, variable Values: values are terms!! • Typically terms in normal form • Justifies the name “calculus” Environments: Not used! • (but names stand for terms) Evaluation rules: coming up Initial basis: sometimes empty, sometimes constants c ©Copyright 2002 Norman Ramsey, revisions copyright 2004 Allyn Dimock. All Rights Rese rved. 7 Operational semantics of lambda calculus New kind of operational semantics: small-step Judgment: M → N (“M reduces to N in one step”) • No environment! • Just pushing terms around: calculus The substitution model in 91.301 c ©Copyright 2002 Norman Ramsey, revisions copyright 2004 Allyn Dimock. All Rights Rese rved. 8

On the implementation of AMBIT/G: a graphical programming language

Abstract: This paper deals with the implementation of an interactive graphical programming language for the manipulation of directed graphs. Interesting aspects of the design and a user's view of the facilities are presented. The language is a modified version of AMBIT/G; a brief description of AMBIT/G is contained in the introduction.

A base for a mobile programming system

Abstract: An algorithm for a macro processor which has been used as the base of an implementation, by bootstrapping, of processors for programming languages is described. This algorithm can be easily implemented on contemporary computing machines. Experience with programming languages whose implementation is based on this algorithm indicates that such a language can be transferred to a new machine in less than one man-week without using the old machine.

The IITRAN programming language

Abstract: The IITRAN language, developed to be used by students, and its important features are described. IITRAN is a procedure-oriented language with a one-level block structure and a variety of data types. Several novel and powerful features are included. A discussion of design principles to be followed in a student language is given.

Formal models for some features of programming languages

Abstract: In this paper we attempt to tighten the connections between classical mathematics, automata theory, and the theory of programming languages. Formal linguistic objects corresponding to programs are defined via sets of functional equations; two interpretations of such an object are given, one in classical mathematics, and one in terms of an abstract machine that executes the program. Within this framework we examine flow charts, recursion, parameterization, and declaration.

Cogent--programming manual

Abstract: COGENT /COmpiler and GENeralized Translator/ programming system is a compiler whose input language enables a description of symbolic and linguistic manipulation algorithms Primarily for use as a compiler-compiler, it is also applicable to algebraic manipulation, mechanical theorem proving, and heuristic programming

The extension facilities of IMP

Abstract: The objective for the extension feature of the programming language Imp is to provide an extension capability powerful enough to describe in detail the construction of a useful compiler for common programming languages, yet simple enough to allow unsophisticated programmers to make useful modifications to the language. Particular emphasis is given to keeping the concepts and constructions concise and few in number.

Towards a theory of semantics and compilers for programming languages

Abstract: The concept of imbedding a programming language L into a formal system is introduced and used as the basis of defining the semantics Θ of the language Θ is an operator which maps a program p in L onto a function The pair (L, Θ) is called a programming system If (L, Θ) and (L,' Θ') are two programming systems, a mapping Γ from L into L' is called a compiler A compiler is said to be correct if Θ'(Γ(p)) = Θ(p) for p in L These ideas are illustrated in terms of two programming systems, one for recursive functions and the other for Turing machines