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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Higher-Order Model Checking: From Theory to Practice

Higher-Order Model Checking: From Theory to Practice

引用

26th Annual IEEE Symposium on Logic in Computer Science (LICS)

作者： Kobayashi, Naoki Tohoku Univ Sendai Miyagi 980 Japan

ISBN: (纸本)9780769544120

The model checking of higher-order recursion schemes (higher-order model checking for short) has been actively studied in the last decade, and has seen significant progress in both theory and practice. From a practical perspective, higher-order model checking provides a foundation for software model checkers for functional programming languages such as ML and Haskell. This short article aims to provide an overview of the recent progress in higher-order model checking and discuss future directions.

关键词： Model checking higher-order theories functional programming language Computer programming languages functional programming

来源：评论

学校读者我要写书评

暂无评论

The Problem with Data 14

The Problem with Data

引用

IEEE/ACM 7th International Conference on Utility and Cloud Computing (UCC)

作者： Fritsch, Joerg Walker, Coral Cardiff Univ Sch Comp Sci & Informat Cardiff CF24 3AA S Glam Wales

ISBN: (纸本)9781479978816

Utility Computing requires levels of efficacy and abstraction that are not matched by modern computing clouds. In this paper we argue that the lack of harmonization of data and computation is holding back computing clouds from evolving further into utility clouds. Data gravity is perceived as gravity pull associated with data volume. Data of large volume develop large gravity that pulls computation to it, which contrasts with the computation-centered principle of current computing clouds, where computational resources are centralized and fixed. Based on previous research, eight principles are identified to suggest an infrastructure for a future data-driven utility computing platform. The paper also argues that tuple spaces and functional programming languages together would be a powerful combination to meet the requirements for this next-generation computing utility.

关键词： functional languages functional programming utility programs centralized-fixed computational resources computation-centered principle data computation data gravity data harmonization data volume data-driven utility computing platform functional programming languages gravity pull next-generation computing utility tuple spaces Cloud computing Computational modeling Data models Distributed databases Fabrics Gravity programming functional programming Utility routines distributed databases Gravity data models Cloud Computing Computational modeling Textile fabrics fabric programming Utility computing functional programming language Clouds

来源：评论

学校读者我要写书评

暂无评论

Introducing Support for Erlang into SSQSA framework

Introducing Support for Erlang into SSQSA framework

引用

International Conference on Numerical Analysis and Applied Mathematics (ICNAAM)

作者： Toth, Melinda Pater-Reszeg, Attila Rakic, Gordana Eotvos Lorand Univ Fac Informat Dept Programming Languages & Compilers H-1364 Budapest Hungary ELTE Soft Ltd Budapest Hungary Univ Novi Sad Fac Sci Dept Math & Informat YU-21000 Novi Sad Serbia

ISBN: (纸本)9780735412873

Set of Software Quality Static Analyzers (SSQSA) is a framework which includes set of software tools for static analysis. Starting aim of the framework is consistent software quality analysis. The main characteristic of all integrated tools is the independency of the input programming language. Each of the integrated analysers can be uniformly applied to any software systems that are written in different programming languages. In SSQSA framework, language independency is achieved by enriched Concrete Syntax Tree (eCST). eCST is used as an internal representation of the source code. Currently, SSQSA supports some representative input languages. Still the support for functional language is missing. For introducing the support for new input language into SSQSA framework straightforward semi-automated procedure is established. In this paper we explore possibility to add support for functional languages into SSQSA framework. Furthermore, we describe alternative way to add support for new language. Described research is made on the case of Erlang.

关键词： enriched concrete syntax tree semantic graph static analysis functional programming language Erlang

来源：评论

学校读者我要写书评

暂无评论

Robin Milner, a Craftsman of Tools for the Mind

Robin Milner, a Craftsman of Tools for the Mind

引用

25th Annual IEEE Symposium on Logic in Computer Science (LICS 2010)

作者： Plotkin, Gordon D. Univ Edinburgh Sch Informat Lab Fdn Comp Sci Edinburgh Midlothian Scotland

The paper discusses about the programming language ML (or Metalanguage) as a language for manipulating formal systems. It has also had much influence on the further development of functional programming languages.

ISBN: (纸本)9780769541143

关键词： ML language formal system manipulation functional programming language meta language programming languages

来源：评论

学校读者我要写书评

暂无评论

Mechanical verification of interactive programs specified by use cases 3

Mechanical verification of interactive programs specified by...

引用

IEEE/ACM 3rd FME Workshop on Formal Methods in Software Engineering

作者： Claret, Guillaume Regis-Gianas, Yann Univ Paris Diderot Sorbonne Paris Cite PPS CNRSUMR 7126PiR2INRIA Paris Rocquencourt F-75205 Paris France

ISBN: (纸本)9781467370431

Interactive programs, like user interfaces, are hard to formally specify and thus to prove correct. Some ideas coming from functional programming languages have been successful to improve the way we write safer programs, compared to traditional imperative languages, but these ideas mostly apply to code fragments without any inputs-outputs. Using the purely functional language Coq, we present a new technique to represent interactive programs and formally verify use cases using the Coq proof engine as a symbolic debugger. To this end we introduce the notion of scenarios, well-typed schema of interactions between an environment and a program. We design and certify a blog system as an illustration. Our approach generalizes unit-testing techniques and outlines a new method for mechanically assisted checking of effectful functional programs.

关键词： mechanical verification Interactive programs functional programming User Interface Device Component ILLUSTRATIONS functional programming language

来源：评论

学校读者我要写书评

暂无评论

ML Polymorphism of Linear Lambda Calculus with First-class Continuations 19

ML Polymorphism of Linear Lambda Calculus with First-class C...

引用

8th International Conference on Software and Computer Applications (ICSCA)

作者： Nishizaki, Shin-ya Tokyo Inst Technol 2-12-1 Ookayama Meguro Tokyo 1528552 Japan

ISBN: (纸本)9781450365734

The Curry-Howard isomorphism shows that an intuitionistic deductive system is similar to a formal computational system;propositions correspond to types, proofs to lambda-terms, and a proof normalization procedure to an evaluation strategy. Furthermore, the duality between computation values and continuations is discovered under the Curry-Howard isomorphism. In the traditional lambda calculus, duplication and erasing of values are allowed but those of continuations prohibited. On the other hand, in the lambda calculus with first-class continuations, both values and continuations are permitted to be duplicated and erased. In our previous paper, we proposed a linear lambda calculus with first-class continuations, in which we cannot duplicate and erase values but can do continuations. In this paper, we propose an ML polymorphic type system for the linear lambda calculus with first-class continuations and design a type inference algorithm of the type system.

关键词： programming language theory functional programming language lambda calculus linear logic continuations Curry-Howard isomorphism ML type system

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：