Abstract data types are a widely accepted means for enhancing software reliability and data security. The objection raised against abstract data type based programminglanguages is their run time inefficiency when exe...
详细信息
A function Is said to be strict In one of its formal parameters If, In all calls to the function, either the corresponding actual parameter Is evaluated, or the call does not terminate, Detecting which arguments a fun...
详细信息
ISBN:
(纸本)089791175X
A function Is said to be strict In one of its formal parameters If, In all calls to the function, either the corresponding actual parameter Is evaluated, or the call does not terminate, Detecting which arguments a function will surely evaluate Is a problem that arises often In program transformation and compiler optimization. We Present a strategy that allows one to Infer strictness properties of functions expressed In the lambda calculus. Our analysis Improves on previous work In that (l) a set-theoretic characterization of strictness Is used that permits treatment of free variables, which in turn permits a broader range of interpretations, and (2) the analysis provides an effective treatment of higher-order functions, We also prove a result due to Meyer [15] : the problem of first-order strictness analysis Is complete In deterministic exponential time. However, because the size of most functions Is small, the complexity seems to be tractable In practice. This research was supported In part by NSF Grant MCS-8302018, and a Faculty Development Award from IBM.
The design and implementation of a simulator for on-line arithmetic algorithms are described. The simulator evaluates arithmetic expressions given in a highly functional form. Presently, the set of operations supporte...
详细信息
The design and implementation of a simulator for on-line arithmetic algorithms are described. The simulator evaluates arithmetic expressions given in a highly functional form. Presently, the set of operations supported include addition, subtraction, multiplication, division, and square root. Several examples are presented to illustrate the usage of the simulator. The simulator package is implemented in 'C' language on a VAX 11/780 system.
The proceedings contain 30 papers. The special focus in this conference is on Formalization of programming Concepts. The topics include: Scenarios: A model of non-determinate computation;an operational semantics for a...
ISBN:
(纸本)9783540106999
The proceedings contain 30 papers. The special focus in this conference is on Formalization of programming Concepts. The topics include: Scenarios: A model of non-determinate computation;an operational semantics for a language with early completion data structures;le calcul des fermetures dans les lambda-langages;distributed termination with interval assertions;algebraic denotational semantics using parameterized abstract modules;relational semantics of strongly communicating sequential processes;a construction of concurrent systems by means of sequential solutions and concurrency relations;the development of an interpreter by means of abstract algebraic software specifications;The VDM principles of software specification & program design: A tutorial overview;a formal model of an interpreter for nonprocedural languages;proof theoretic methodology for propositional dynamic logic;FP systems in edinburgh LCF;a proposal for operational semantics and equivalence of finite asynchronous processes;an extension to horn clause logic allowing the definition of concurrent processes;a semantic algebra for binding constructs;on the representation of data types;an approach to communications and parallelism in applicative languages;using least fixed points to characterize formal computations of non-deterministic equations;formal representations for recursively defined functional programs;attribute grammars : Theory and applications;petri nets and concurrency-like relations;compiler generation from formal definition of programminglanguages : A survey;formal behavioural specification of concurrent systems without globality assumptions;a birkhoff-like theorem for algebraic classes of interpretations of program schemes: For calvin elgot;building data base management systems through formal specification;reducing types in applicative languages with structured data;on the definition of lambda-calculus models.
Register transfer languages are inadequate as a convenient mathematical formalism which will facilitate the description, analysis, and synthesis of digital systems at various levels of complexity. functional programmi...
详细信息
Register transfer languages are inadequate as a convenient mathematical formalism which will facilitate the description, analysis, and synthesis of digital systems at various levels of complexity. functionalprogramming is considered as an alternative, where the functions correspond to basic modules of combinational logic and the functionals represent the interconnections of these modules. That information which constitutes memory is represented as elements of sequences. Several examples are given, along with a methodology for synthesis.
Programs for data flow machines are written in functionallanguages, some of which require efficient support for dynamic procedure invocation to achieve high performance and programming flexibility. Among the proposed...
详细信息
Programs for data flow machines are written in functionallanguages, some of which require efficient support for dynamic procedure invocation to achieve high performance and programming flexibility. Among the proposed data flow machines, few support procedures in any generality. The present machine, which is a hardware realization of the U-interpreter for data flow languages, provides support for a variety of procedure calling conventions. Because the U-interpreter assigns a unique activity name to each instance of a computation (activity), an activity name may become arbitrarily large in the case of nested or recursive procedure calls.
A high level specification language called Business Data-Flow Language (BDFL) based on the data-flow model of computation is described in this paper. A translator to convert BDFL specifications into COBOL programs has...
详细信息
ISBN:
(纸本)9780897910606
A high level specification language called Business Data-Flow Language (BDFL) based on the data-flow model of computation is described in this paper. A translator to convert BDFL specifications into COBOL programs has been implemented. A novel feature of the proposed translation system is the use of Data Base Management System (DBMS) in conjunction with COBOL. This relieves the user of the need to define data structures for the intended data processing application.
A parallel program often defines a relation not a function. The program constrains the output to lie in some relation R to the input, but the particular output produced during a computation can depend on the time beha...
ISBN:
(纸本)9780897910606
A parallel program often defines a relation not a function. The program constrains the output to lie in some relation R to the input, but the particular output produced during a computation can depend on the time behaviour of component processes. This suggests the use of a relational language as an applicative language for parallel *** Horn clause subset of predicate logic is a relational language with an established procedural interpretation for non-deterministic sequential computations [Kowalski 1974]. In this paper we modify and extend that interpretation to define a special purpose parallel evaluator.
Proceedings includes 162 papers grouped into 37 sessions dealing with computer graphics and architecture, microprocessors, speech, marketing, computer peripherals, voice processing, technical writing and publishing, m...
详细信息
Proceedings includes 162 papers grouped into 37 sessions dealing with computer graphics and architecture, microprocessors, speech, marketing, computer peripherals, voice processing, technical writing and publishing, memories, ICs, LSI, fiber optics, soldering, computer interfaces and software, batteries, legal aspects, offices of the future, industrial control, and desk top computers. Topics covered include: signal processing, correlators, telephony, electric measuring instruments, displays, patents and inventions, programminglanguages, IR devices, logic circuits, amplifiers, oscillators, printed circuits, pressure transducers, data processing and conversion, sensory and learning aids, electric generators, electric network analyzers, sensors, and economic aspects. Technical and professional papers from this conference are indexed with the conference code no. 00193 in the Ei Engineering Meetings (TM) database produced by Engineering Information, Inc.
The functional or applicative languages have long been regarded as suitable vehicles for overcoming many of the problems involved in the production and maintenance of correct and reliable software. However, their inhe...
ISBN:
(纸本)9780897910606
The functional or applicative languages have long been regarded as suitable vehicles for overcoming many of the problems involved in the production and maintenance of correct and reliable software. However, their inherent inefficiences when run on conventional von Neumann style machines have prevented their widespread acceptance. With the declining cost of hardware and the increasing feasibility of multi-processor architectures this position is changing, for, in contrast to conventional programs where it is difficult to detect those parts that may be executed, concurrently, applicative programs are ideally suited to parallel *** this paper we present a scheme for the parallel evaluation of a wide variety of applicative languages and provide an overview of the architecture of a machine on which it may be *** we describe the scheme, which may be characterized as performing graph reduction, at the abstract level and discuss mechanisms that allow several modes of parallel evaluation to be achieved efficiently. We also show how a variety of languages are *** then suggest an implementation of the scheme that has the property of being highly modular; larger and faster machines being built by joining together smaller ones. Performance estimates illustrate that a small machine (of the size that we envisage would form the basic building block of large systems) would provide an efficient desk-top personal applicative computer, while the larger versions promise very high levels of performance Indeed. The machine is designed to be ultimately constructed from a small number of types of VLSI *** we compare our approach with the other proposes schemes for the parallel evaluation of applicative languages and discuss planned future developments.
暂无评论