检索结果-内蒙古大学图书馆

DAC 1981 - the 18th Design Automation conference

作者： Raeth, Peter G. Acken, John M. Lamont, Gary B. Borky, John M. Air Force Institute of Technology Wright-Patterson Air Force Base DaytonOH United States Division 2113 Sandia National Laboratories AlbuquerqueNM United States

As digital integrated circuits become more complex, computer Aided Design (CAD) must support more hierarchical design methods. Top-down design is supported in logic simulators by the inclusion of functional models. The SAndia LOGic Simulator (SALOGS) has functional modelling capability but until now only as FORTRAN subroutines. The new Structural Interface to the SALOGS Language (SISL) allows the design engineer access to the functional modelling capabilities without requiring the associated programming skills. The SISL syntax is described and a sample functional model library is presented. © Institute of Electrical and Electronics Engineers Inc. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

The realization of a data type architecture 3rd

The realization of a data type architecture

引用

3rd conference of the European Cooperation in Informatics on Trends in Information Processing Systems, 1981

作者： Giloi, W.K. Gueth, R. Technical University of Berlin Fachbereich Informatik - CAMP Germany

ISBN: (纸本)9783540108856

Abstract data types are a widely accepted means for enhancing software reliability and data security. The objection raised against abstract data type based programming languages is their run time inefficiency when executed on a conventional machine. In the paper, a data type architecture is described which offers efficient and convenient mechanisms for constructing arbitrary data structures and user-defined abstract data types, thus avoiding the inefficiency penalty mentioned above. Through a process of hierarchical decomposition, user-defined abstract data types are mapped on representations given in terms of a basic structured machine data type. This approach combines high performance with generality and completeness. The architecture is structured as a strongly coupled, asymmetric multiprocessor system and includes a pipeline for processing objects of the vector-structured machine data type. Software reliability is enhanced by consistency checks performed at run time. © by Springer-Verlag Berlin Heidelberg 1981.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

Higher-order strictness analysis in untyped lambda calculus 86

Higher-order strictness analysis in untyped lambda calculus

引用

13th AnnuaJ ACM Symposium on the Principles of programming languages, POPL 1986

作者： Hudak, Paul Young, Jonathan Yale University Department of Computer Science United States

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.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

SIMULATOR FOR ON-LINE ARITHMETIC.

SIMULATOR FOR ON-LINE ARITHMETIC.

引用

Proc - Symp on Comput Arith, 5th

作者： Raghavendra, C.S. Ercegovac, M.D.

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.

关键词： computer programming

来源：评论

学校读者我要写书评

暂无评论

1st International Colloquium on the Formalization of programming Concepts, ICFPC 1981

1st International Colloquium on the Formalization of Program...

引用

1st International Colloquium on the Formalization of programming Concepts, ICFPC 1981

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 programming languages : 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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MULTIPLE PROCESSOR DATA FLOW MACHINE THAT SUPPORTS GENERALIZED PROCEDURES.

Conference Proceedings - Annual Symposium on Computer Archit...

引用

conference Proceedings - Annual Symposium on computer architecture 1981年 291-302页

作者： Arvind Kathail, Vinod

Programs for data flow machines are written in functional languages, 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.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

A data-flow language for specifying business data processing applications 81

A data-flow language for specifying business data processing...

引用

Proceedings of the 1981 conference on functional programming languages and computer architecture

作者： Vishv M. Malhotra V. Rajaraman Computer Science Proqram Indian Institute of Technoloy Kanpur (208 016) India

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.

关键词： Translation DBMS Specification languages Business data processing Non-procedural languages Data-flow languages

来源：评论

学校读者我要写书评

暂无评论

A relational language for parallel programming 81

A relational language for parallel programming

引用

Proceedings of the 1981 conference on functional programming languages and computer architecture

作者： Keith L. Clark Steve Gregory Department of Computing Imperial College London SW7 2BZ England

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

WESCON/81 conference RECORD, 1981.

Wescon Conference Record

引用

Wescon conference Record 1981年 25卷 varpaging页

作者： Anon

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, programming languages, 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.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

ALICE a multi-processor reduction machine for the parallel evaluation CF applicative languages 81

ALICE a multi-processor reduction machine for the parallel e...

引用

Proceedings of the 1981 conference on functional programming languages and computer architecture

作者： John Darlington Mike Reeve Department of Computing Imperial College of Science and Technology 180 Queens Gate London

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：