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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

75 篇 会议
10 篇 期刊文献
1 册 图书

馆藏范围

86 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

72 篇 工学
- 68 篇 计算机科学与技术...
- 62 篇 软件工程
- 5 篇 电子科学与技术（可...
- 5 篇 信息与通信工程
- 4 篇 电气工程
- 3 篇 力学（可授工学、理...
- 3 篇 材料科学与工程（可...
- 3 篇 控制科学与工程
- 3 篇 建筑学
- 2 篇 土木工程
- 2 篇 农业工程
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 化学工程与技术
- 1 篇 石油与天然气工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
29 篇 理学
- 25 篇 数学
- 3 篇 物理学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
5 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 工商管理
- 2 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 军事学

主题

14 篇 computer program...
8 篇 functional progr...
8 篇 computer softwar...
4 篇 semantics
4 篇 computer program...
3 篇 computer archite...
2 篇 computer systems...
2 篇 computational co...
2 篇 set theory
2 篇 calculations
2 篇 computer metathe...
2 篇 data structures
1 篇 object oriented ...
1 篇 computer circuit...
1 篇 parallel archite...
1 篇 function evaluat...
1 篇 libraries
1 篇 modeling languag...
1 篇 data-flow langua...
1 篇 program interpre...

机构

4 篇 department of co...
3 篇 department of co...
2 篇 yale university ...
1 篇 western electric...
1 篇 computer systems...
1 篇 univ of york yor...
1 篇 computer science...
1 篇 univ of glasgow ...
1 篇 department of co...
1 篇 canon inc kanaga...
1 篇 department of co...
1 篇 department of co...
1 篇 univ of amsterda...
1 篇 icad inc. 1000 m...
1 篇 university colle...
1 篇 department of co...
1 篇 hewlett-packard ...
1 篇 massachusetts in...
1 篇 department of in...
1 篇 oldenburg univer...

作者

5 篇 anon
3 篇 arvind
2 篇 kathail vinod
2 篇 smoliar stephen ...
2 篇 runciman colin
2 篇 keller robert m.
2 篇 frankel robert e...
2 篇 hudak paul
2 篇 raghavendra c.s.
2 篇 ercegovac m.d.
2 篇 ariola zena
2 篇 manwaring mark l...
2 篇 meador jack l.
1 篇 mishra prateek
1 篇 musser d.r.
1 篇 seaman jill
1 篇 ang boon seong
1 篇 spillinger ilan
1 篇 frankel robert
1 篇 maritsas d.g.

语言

76 篇 英文
10 篇 其他

检索条件"任意字段=1981 Conference on Functional Programming Languages and Computer Architecture, FPCA 1981"

共 86 条记录，以下是51-60 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

On the relation between functional and data parallel programming languages 93

On the relation between functional and data parallel program...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Hammarlund, Per Lisper, Bjorn Royal Inst of Technology Stockholm Sweden

ISBN: (纸本)089791595X

Data parallel programming is becoming an increasingly important tool for exploiting parallelism in data-intensive applications, especially on SIMD and vector computers. Many algorithms appearing in such applications are very succinctly expressed in data parallel languages: this indicates that data parallel programming can be a powerful abstract programming paradigm rather than just a syntax for explicit programming of SIMD computers. The data parallel languages in practical use today are, however, exponents of exactly the latter point of view: even though they incorporate some elements of abstraction, their semantics are all to some extent based on a SIMD execution model. Therefore it is hard to use these languages to express algorithms in the problem domain in an abstract, machine-independent way. This is likely to make programming in these languages more error-prone and programs less portable than if they had been designed with a more clean-cut abstract semantics. Here, we present some mathematical definitions of data parallel primitives that can be used to guide the design of data parallel languages with a higher level of abstraction. The key idea is to view data parallel entities as tabulated functions where the tables are stored in a distributed fashion. Operations on data parallel entities are then simply operations on functions, just as operations in pure functional languages. An interesting observation is that also traditional data structures, like lists and arrays, are covered by our view. This illustrates the level of abstraction achieved. An especially interesting possibility is to integrate data parallel and higher order functional languages. Data parallel entities are then just a particular class of functions that can be represented in a particular way. We believe that such languages are very suitable as specification languages for data parallel algorithms.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Short cut to deforestation

Short cut to deforestation

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Gill, Andrew Launchbury, John Jones, Simon L.Peyton Univ of Glasgow Glasgow United Kingdom

Lists are often used as `glue' to connect separate parts of a program together. We propose an automatic technique for improving the efficiency of such programs, by removing many of these intermediate lists, based ... 详细信息

ISBN: (纸本)089791595X

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Towards lazy evaluation, sharing and non-determinism in resolution based functional logic languages 93

Towards lazy evaluation, sharing and non-determinism in reso...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Liu, Feixiong Oldenburg Universitaet Oldenburg Germany

ISBN: (纸本)089791595X

Lazy evaluation and sharing are two of the most important issues in implementations of lazy functional languages. However they are either inadequately handled or put aside in most of the current implementations of resolution based functional logic languages which usually adopt extended versions of the Warren Abstract Machine (WAM) as their implementation vehicles. It is partly due to the fact that lazy evaluation is `alien' to the WAM based approaches and sharing becomes more tricky due to non-determinism. Although non-determinism is naturally supported in these approaches, deterministic computation may suffer from overheads of creating and manipulating unnecessary choice points. These are the main issues to be addressed in this paper. We first demonstrate how lazy evaluation can be naturally implemented using the concepts of graph rewriting in a resolution based functional logic framework. Then we identify two basic forms of sharing existing in such a framework: deterministic and non-deterministic sharing, and show both forms of sharing can be effectively exploited using the principle of generalized graph rewriting techniques. And finally we show that both static and dynamic detection of determinism can be facilitated by the directionality of functions.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Assessing the evaluation transformer model of reduction on the spineless G-machine 93

Assessing the evaluation transformer model of reduction on t...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Finne, Sigbjorn Burn, Geoffrey Imperial Coll of Science Technology and Medicine London United Kingdom

ISBN: (纸本)089791595X

This paper reports on our initial work on assessing how using the evaluation transformer model of reduction affects the performance of lazy functional programs. The model uses information about how much evaluation of an expression is required in order to evaluate an expression as much as possible, as early as possible. Our results show that there is a definite gain over just using strictness information, but that it is difficult to characterize exactly how much gain there will be, and in what programs it will occur.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Strictness analysis using abstract reduction 93

Strictness analysis using abstract reduction

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Nocker, Eric Univ of Nijmegen Nijmegen Netherlands

ISBN: (纸本)089791595X

In this paper we present a new and general strictness analysis technique for lazy functional languages. In contrast to many other methods, this method is practically usable. This is shown with results of a real implementation. The key idea is the use of an abstract domain of which the elements represent various kinds of sets of concrete values. Reduction as well as pattern matching in the abstract domain mimics reduction and pattern matching in the concrete domain in a very natural way. With this abstract domain various kinds of strictness analysis are possible. In particular, higher order functions and general data types (tuples and lists, but also user defined data types) fit perfectly well in this mechanism. In contrast to methods based on abstract interpretation, the abstract domain is infinite. Recursive functions are handled by a technique called reduction path analysis. Complicated and expensive fixed point derivation techniques are not needed. The implementation in the Concurrent Clean system shows that the analyzer is very fast and that it finds much strictness information.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Experience with a large scientific application in a functional language 93

Experience with a large scientific application in a function...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Page, Rex L. Moe, Brian D. Amoco Production Co Houston TX United States

ISBN: (纸本)089791595X

Simulating fluid flow in oil reservoirs requires a great deal of numeric computation. Even a modest model may consume many hours on the fastest computing equipment. The software expressing reservoir models is large and complex, typically tens of thousands to hundreds of thousands of lines of Fortran code. For these reasons, reservoir models provide an interesting environment in which to test ideas in programming languages and high performance computation. This paper reports on the first part of an experiment in these domains, namely the development in a purely functional language of a reservoir simulation system comparable in function to models used in the oil industry. The product of this effort is a 200-page LATEXdocument in which a Miranda program is embedded. The program was derived from the scientific equations underlying reservoir models and from the engineering documentation associated with existing software written in Fortran. The Fortran code itself was not consulted except to build test datasets. The Miranda/LATEXdocument, as it stands, is suitable for reservoir engineers to use as a readable specification of a reservoir simulation system. The document can serve as a basis for studies of the properties of large functional programs expressing scientific computations. It can also serve as a basis for the originally planned second part of the experiment: mapping the computation onto a high performance, parallel computer. Software researchers may find the experiences reported in this paper a useful data point in studies of the effects of programming languages on scientific application development.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Compiler-directed type reconstruction for polymorphic languages 93

Compiler-directed type reconstruction for polymorphic langua...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Aditya, Shail Caro, Alejandro MIT Lab for Computer Science Cambridge MA United States

ISBN: (纸本)089791595X

In tagless implementations of polymorphic languages, the run-time types of data objects may not be completely determined at compile-time. With ML-like static type-checking, a static type template can be produced for each polymorphic function that may be instantiated at run-time according to the types of its actual arguments. Still, as noted in, it may not be possible to reconstruct the types of some objects that are hidden inside a closure. This creates problems for applications like garbage collection and source debugging that need to understand the entire run-time state of the machine. In this paper, we present a compiler-directed type reconstruction scheme for ML-like languages that reconstructs complete type information of all objects at run-time without using universal type-tags. Our scheme explicitly propagates compiler generated hints at run-time whenever there is a danger of losing the type information otherwise. We show a compilation strategy to automatically detect, generate and propagate such hints and a type reconstruction algorithm that uses them in the context of a source debugger for the Id language. We also show several compiler optimizations that reduce the run-time overhead of propagating these hints.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A multiple processor data flow machine that supports generalized procedures 8

A multiple processor data flow machine that supports general...

引用

8th Annual Symposium on computer architecture, ISCA 1981

作者： Arvind Kathail, Vinod Laboratory of Computer Science Massachusetts Institute of Technology CambridgeMA United States

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. Our 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. Hardware considerations, however, require that an activity name be represented by a fixed-size tag. We describe a mechanism that uses fixed-size, reusable tags in hardware. Like processor and memory resources, a group of tags is allocated and deallocated for each procedure activation. The proposed mechanism passes procedure arguments and results efficiently, given the distributed environment of our machine. © 1981 IEEE.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Efficient implementation of sequential loops in dataflow computation 93

Efficient implementation of sequential loops in dataflow com...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Ang, Boon Seong Massachusetts Inst of Technology Cambridge MA United States

ISBN: (纸本)089791595X

The implementation of sequential loops in dataflow computation had traditionally not received very much attention as it was assumed that most loops would be executed in parallel. This assumption was valid for earlier dataflow machines such as the MIT Tagged Token Dataflow architecture (TTDA), Sigma-1 but not for the newest generation of dataflow machines including Monsoon, EM-4 and Epsilon-2. On the latter machines, sequential loops use less memory, and can execute in fewer instructions, albeit with lower parallelism than the parallel versions. This characterization of sequential and parallel loops suggests that programs should have parallel outer loops and sequential inner loops. The run time of sequential loops therefore become significant in the overall run time. We also found that previous implementations of sequential loops can incur fairly high overheads. In this paper, we present two new ways of implementing sequential loops that have lower overhead then previous methods. We studied this problem in the context of compiling Id for Monsoon.

关键词： computer systems programming

来源：评论

学校读者我要写书评

暂无评论

Real-time deques, multihead Turing machines, and purely functional programming

Real-time deques, multihead Turing machines, and purely func...

引用

Proceedings of the 6th International conference on functional programming languages and computer architecture (fpca '93)

作者： Chuang, Tyng-Ruey Goldberg, Benjamin New York Univ New York United States

ISBN: (纸本)089791595X

We answer the following question: Can a deque (double-ended queue) be implemented in a purely functional language such that each push or pop operation on either end of a queue is accomplished in O(1) time in the worst case? The answer is yes, thus solving a problem posted by Gajewska and Tarjan and by Ponder, McGeer, and Ng, and refining results of Sarnak and Hoogerwoord. We term such a deque real-time, since its constant worst-case behavior might be useful in real time programs (assuming real-time garbage collection, etc.) Furthermore, we show that no restriction of the functional language is necessary, and that push and pop operations on previous versions of a deque can also be achieved in constant time. We present a purely functional implementation of real-time deques and its complexity analysis. We then show that the implementation has some interesting implications, and can be used to give a real-time simulation of a multihead Turing machine in a purely functional language.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：