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

Conference on Advanced Topics in Optoelectronics, Microelectronics and Nanotechnologies X

作者： Bira, Calin Gugu, Liviu Univ Politehn Bucuresti Fac Elect Telecommun & Informat Technol ETTI Dept Devices Circuits & Elect Architectures DCAE Bucharest Romania

ISBN: (纸本)9781510642720

In this paper we investigate writing and using of a functional parallel-machine simulator, in a functional programming language as opposed to an imperative programming language, in terms of code-size, versatility and performance. As a use-case we chose a SIMD-type machine, and the Racket/Scheme programming language,. The main advantages over the use of imperative programming languages for creating architectural simulators are (i)divided by the loose coupling to the architecture and (ii) the lack of an explicit compiler. By attempting two common software implementations and some changes to the base architecture we argue that the simulator is better in terms of algorithm-code size and system versatility (number of required changes for extending functionality) but not in execution speed (as it is running on a von Neumann machine, where C++ code is compiled into native machine code, not interpreted)

关键词： Lisp Scheme functional programming language parallel machine functional simulator

来源：评论

学校读者我要写书评

暂无评论

OPERATIONAL MACHINE SPECIFICATION IN A functional programming language

引用

SOFTWARE-PRACTICE & EXPERIENCE 1995年第5期25卷 463-499页

作者： KOOPMAN, PWM VANEEKELEN, MCJD PLASMEIJER, MJ UNIV NIJMEGEN DEPT COMP SCINIJMEGEN 6525 EDNETHERLANDS

This paper advocates the use functional programming languages for the formal specification of (abstract) machines. The presented description method describes machines by a two-Level model. At the bottom layer machine components and the micro instructions to handle them are described by using an abstract data type. The top layer describes the machine instructions in terms of these micro instructions. Using a functional language as specification language has several advantages. The abstraction mechanisms offered by a functional programming language are that good that one can abstract from irrelevant details as is required for a specification language. functional languages have a well-defined semantics such that the meaning of the specification is clear as well. Moreover, they offer the advantages of a programming language: the compiler can check the specification for partial correctness, eliminating for example type errors and unbound identifiers (errors which occur in many published descriptions). Furthermore, the specification can be executed such that one obtains a prototype implementation almost for free. Such an executable formal specification can, for instance, be used to investigate the dynamic behaviour of the described machine. For a simple machine, the proposed description method is compared with several other description methods: a traditional style, a denotational semantics and a formal specification in the language Z. To show that the proposed method is indeed useful to describe large and complicated machines, the method is applied for the specification of an abstract imperative graph rewrite machine (the ABC-machine) which has been used in the construction of the compiler for the functional language Concurrent Clean.

关键词： functional programming language FORMAL SPECIFICATION MACHINE SPECIFICATION PROTOTYPE IMPLEMENTATION EXECUTABLE SPECIFICATION

来源：评论

学校读者我要写书评

暂无评论

INCORPORATING THE PARALLEL-PROCESSING TECHNIQUES WITH THE DEMAND-DRIVEN MODEL OF functional programming-languageS

INCORPORATING THE PARALLEL-PROCESSING TECHNIQUES WITH THE DE...

引用

TENCON 93 - 1993 IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering

作者： SHEN, H KOBAYASHI, H NAKAMURA, T TOHOKU UNIV DEPT MACHINE INTELLIGENCE & SYST ENGNSENDAIMIYAGI 980JAPAN

ISBN: (纸本)780003285X

This paper presents a hybrid reduction scheme that incorporates parallel processing techniques into the demand-driven model of functional programs. With this scheme, functional language programs can be executed in parallel at three different levels, which are the parallel execution of vectors inside a redex, the parallel reduction of multiple redexes, and the high level pipeline processing. The high level pipeline consists of three stages that are redex detection, redex allocation and reduction execution. Moreover, memory latency and switch network latency that cannot be ignored in usual multiprocessor systems can effectively be eliminated by embedding the memory access and the switch network transmission into the high level pipeline. Experimental results of the software simulator reveal the potential performance of the hybrid reduction scheme. functional language FL is chosen as the target language in our research work.

关键词： functional programming language FL PARALLEL PROCESSING PIPELINE PROCESSING DEMAND-DRIVEN MODEL

来源：评论

学校读者我要写书评

暂无评论

Reversible functor: Immutable aggregate with constant time update operation

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1996年第12期E79D卷 1646-1654页

作者： Aoyagi, T Faculty of Electro-Communi Cations University of Electro-Communications Chofushi 182 Japan

In logic programming or functional programming languages, data objects, such as terms and lists, are immutable. In a basic implementation of such language, updating one element of an aggegate (contiguous data structure, such as an array) involves making a new copy of the whole aggregate. However such copying can be expensive, and can be avoided by using a destructive update. We introduce the concept of a wrapper which enables destructive operation on an immutable object. Based on this concept, we designed the reversible functor as a solution to the aggregate update problem. We implemented the reversible functor in the existing SB-Prolog system and carried out several benchmarks. These benchmark results show its effectiveness. When using a large functor and updating it many times, the performance is improved dramatically by implementing the reversible functor. It incurs some overhead at runtime, but the amount is small and acceptable.

关键词： logic programming language functional programming language data structure immutable aggregate update

来源：评论

学校读者我要写书评

暂无评论

Skribe: a functional authoring language

引用

JOURNAL OF functional programming 2005年第5期15卷 751-770页

作者： Gallesio, E Serrano, M Univ Nice F-06903 Sophia Antipolis France INRIA Sophia Antipolis F-06903 Sophia Antipolis France

This paper presents SKRIBE, a functional programming language for authoring documents, especially technical documents such as web pages, technical reports, and API documentation. Executing Skribe programs can produce documents in various formats, such as PostScript, PDF, HTML, Texinfo, or Unix man pages. That is, the very same Skribe program can be used to produce documents in different formats. Skribe is a full featured programming language whose syntax makes it look like a markup language a la HTML.

关键词： functional programming language Technical Report symbolic languages syntax Writers Unix operating system HyperText Markup language language Web pages

来源：评论

学校读者我要写书评

暂无评论

Ur/Web: A Simple Model for programming the Web

引用

COMMUNICATIONS OF THE ACM 2016年第8期59卷 93-100页

作者： Chlipala, Adam MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA

The World Wide Web has evolved gradually from a document delivery platform to an architecture for distributed programming. This largely unplanned evolution is apparent in the set of interconnected languages and protocols that any Web application must manage. This paper presents Ur/Web, a domain-specific, statically typed functional programming language with a much simpler model for programming modern Web applications. Ur/Web's model is unified, where programs in a single programming language are compiled to other "Web standards" languages as needed;supports novel kinds of encapsulation of Web-specific state;and exposes simple concurrency, where programmers can reason about distributed, multithreaded applications via a mix of transactions and cooperative preemption. We give a tutorial introduction to the main features of Ur/Web.

关键词： functional programming language ARCHITECTURE World Wide Web web applications document delivery Building construction programming Distributed software language encapsulation multi-threaded application Web search engines

来源：评论

学校读者我要写书评

暂无评论

Erlang

引用

COMMUNICATIONS OF THE ACM 2010年第9期53卷 68-75页

作者： Armstrong, Joe Ericsson Business Unit Networks Stockholm Sweden

The article presents information on Erlang, a computer programming language available under an open-source license. It is described as a concurrent language which works well for multicore computers. Erlang was developed at the Ericsson telecommunications firm with an emphasis on fault-tolerance, and is said to use a non-defensive programming style which deals with crashes by passing only complete and self-contained messages from machine to machine. This method is described as scaling well, since it allows components to crash without affecting the overall system.

关键词： message passing Multi-core processors programming Computers shared memory Erlang functional programming language program language

来源：评论

学校读者我要写书评

暂无评论

Deterministic Parallel programming with Haskell

引用

COMPUTING IN SCIENCE & ENGINEERING 2012年第6期14卷 36-42页

作者： Coutts, Duncan Loh, Andres Well-Typed LLP Well-Typed LLP

Haskell is a modern, functional programming language with an interesting story to tell about parallelism: rather than using concurrent threads and locks, Haskell offers a variety of libraries that enable concise, high-level parallel programs with results that are guaranteed to be deterministic (independent of the number of cores and the scheduling being used).

关键词： Parallel programming functional languages functional programming Haskell Code Deterministic Parallel programming functional programming language High Level Parallel Programs Parallel Processing Concurrent Computing Parallel programming Poisson Equations Message Systems Computer languages programming Scientific Computing High Performance Code Haskell Applicative functional programming Concurrent programming

来源：评论

学校读者我要写书评

暂无评论

THE IMPLEMENTATION OF FDL, A functional DATABASE language

引用

COMPUTER JOURNAL 1992年第2期35卷 119-128页

作者： POULOVASSILIS, A King's College London Strand London WC2R 2LS

We describe the implementation of the functional database language FDL. FDL improves upon previous languages with a functional data model hy allowing any computable function to he defined and stored and hy supporting arbitrarily nested data types which are all persistent. All functions are updated incrementally by the insertion and deletion of equations, and an integrity sub-system verifies updates against the declared semantic integrity constraints. We show how a binary relational storage structure is used to support all of FDL's persistent data. We also show how the technique of graph reduction from functional programming languages is modified for the evaluation of FDL queries. Finally, we compare our implementation with that of related languages.

关键词： File Definition language functional programming language data types language Memory architecture data models Insertion Mutation functionalS

来源：评论

学校读者我要写书评

暂无评论

PROVING PROPERTIES OF PROGRAMS BY STRUCTURAL INDUCTION

引用

COMPUTER JOURNAL 1969年第1期12卷 41-&页

作者： BURSTALL, RM Department of Machine Intelligence and Perception University of Edinburgh

This paper discusses the technique of structural induction for proving theorems about programs. This technique is closely related to recursion induction but makes use of the inductive definition of the data structures handled by the programs. It treats programs with recursion but without assignments or jumps. Some syntactic extensions to Landin's functional programming language ISWIM are suggested which make it easier to program the manipulation of data structures and to develop proofs about such programs. Two sample proofs are given to demonstrate the technique, one for a tree sorting algorithm and one for a simple compiler for expressions.

关键词： functional programming language Technology induction Data structures theorem proving Proof Recursion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：