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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是11-20 订阅

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

详细简洁

排序：

Applicative Style programming, Program Transformation, and List Operators 81

Applicative Style Programming, Program Transformation, and L...

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Wadler, Philip Carnegie-Mellon University United States

ISBN: (纸本)0897910605

An important feature of the applicative style is the use of operators that package common patterns of computation. For example, the list operator map applies a function to every element of a list. Practical use of this style has been hampered by the fact that it can be very inefficient to execute. One remedy for this situation is to use source-to-source program transformation to convert applicative style prog'rams to more efficient equivalents. This paper examines how list operators can be used to guide the transformation process. It describes a small set of list operators that possess a "complete" set of transformation rules, allowing transformations to be performed very efficiently. Whereas most previous transformation methods resemble proofs, this transformation method resembles algebraic manipulation. © 1981 ACM

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

APPLICATIVE CACHING: Programmer Control of Object Sharing and Lifetime in. Distributed Implementations of Applicative languages 81

APPLICATIVE CACHING: Programmer Control of Object Sharing an...

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Keller, Robert M. Ronan Sleep, M. Department of Computer Science University of Utah Salt Lake CityUT84112 United States Computing Studies Sector University of East Anglia NorwichNR4 7TJ United Kingdom

ISBN: (纸本)0897910605

The "referential transparency" of applicative language expressions demands that all occurrences of an expression in a given context yield the same value. In principle, that value therefore needs to be computed only once. However, in recursive programming, a context usually unfolds dynamically, precluding textual recognition of multiple occurrences, so that such occurrences are recomputed. To remedy the lack, in applicative languages, of an ability to store and retrieve a computed value under programmer control, "caching functionals" are proposed which allow the programmer to selectively avoid recomputation without overt use of assignment. The uses and implementation of such mechanisms are discussed, including reasons and techniques for purging the underlying cache. Our approach is an extension of the early notion of "memo function", enabling improved space utilization and a "building-block" approach. © 1981 ACM

关键词： Purging

来源：评论

学校读者我要写书评

暂无评论

The Semantic Elegance of Applicative languages 81

The Semantic Elegance of Applicative Languages

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Turner, D.A. University of Kent Canterbury United Kingdom

ISBN: (纸本)0897910605

In what does the alleged superiority of applicative languages consist? In the last analysis the answer must be in terms of the reduction in the time required to produce a correct program to solve a given problem. On reflection I decided that the best way to demonstrate this would be to take some reasonably non-trivial problem and show how, by proceeding within a certain kind of applicative language framework it was possible to develop a working solution with a fraction of the effort that would have been necessary in a conventional imperative language. The particular problem I have chosen also brings out a number of general points of interest which I shall discuss briefly *** proceeding it will be necessary for me to quickly outline the language framework within which we shall be working. Very briefly it can be summarised as (non-strict, higher order) recursion equations + set abstraction. Obviously what matters are the underlying semantic concepts, not the particular syntax that is used to express them, but for the sake of definiteness I shall use the notation of KRC (= “Kent RecUrsive Calculator”), an applicative programming system implemented at the University of Kent [Turner 81]. KRC is fairly closely based on the earlier language SASL, [Turner 763, but I have added a facility for set abstraction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

COPYING OPERANDS VERSUS COPYING RESULTS: A SOLUTION TO THE PROBLEM OF LARGE OPERANDS IN FFP'S 81

COPYING OPERANDS VERSUS COPYING RESULTS: A SOLUTION TO THE P...

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Mago, Gyula Department of Computer Science University of North Carolina Chapel Hill United States

ISBN: (纸本)0897910605

In functional programming languages with reduction semantics, operators "use up" their operands to produce their results. This makes it difficult to execute efficiently certain computations, such as one in which several operators are applied-in succession or in parallel—to a large operand. The problem is that providing each operator with a separate copy ot the large operand is a costly operation in most computer models. This paper proposes a solution to this problem in the context of a cellular computer that directly executes FFPs. The operators involved are applied in succession to the large operand, and only their results (with the exception of that ot the last operator applied) need be moved. Providing each operator with a fresh copy of the large operand incurs no overhead in time. The proposed solution often allows one to avoid unproductive copying, and to suppress parallelism when it does not pay. The functional forms conditional, WHILE loop and construction are among the examples discussed. For example, when executing the conditional usually both the predicate and one of the "arms" ot the conditional are applied to the operand. Since the result of the predicate computation is small, the overhead in the execution time of the conditional is negligible, A recursive matrix multiplication program described by Backus uses conditional and construction extensively. The proposed implementation technique reduces the execution time ot tliis program on the cellular computer in question from O(n2) to O(n3). © 1981 Association for Computing Machinery, Inc. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL ASSOCIATIVE SEARCHING ON A CELLULAR computer 81

OPTIMAL ASSOCIATIVE SEARCHING ON A CELLULAR COMPUTER

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Stanat, Donald F. Williams, E. Hollins The University of North Carolina Chapel Hill United States

ISBN: (纸本)0897910605

The performance of the cellular computer proposed by Mago has been investigated by programming a number of associative search algorithms and analyzing the time and space required tor their execution. The present work describes the results of three different analysis techniques applied to algorithms for nearest neighbor and closest pair problems for flies of n points in fc-dimensional space. Brute force methods are described for solving the nearest neighbor problem. If the initial program expression is suitably placed in memory, analysis of the most parallel brute force algorithm yields complexity results of 0(fc) time and 0 (kn) space. These bounds are shown to be asymptotically optimal with respect to the problem and the machine. Brute force, semi-parallel, and divide-and-conquer solutions are described tor solving the closest pair prob¬lem. Analyses of the best semi-parallel algorithms yield complexity results of O(fcn) time and space, which are shown to be asymptotically optimal. © 1981 Association for Computing Machinery, Inc. All rights reserved.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Parsers and printers as stream destructors and constructors embedded in functional languages 89

Parsers and printers as stream destructors and constructors ...

引用

4th International conference on functional programming languages and computer architecture, fpca 1989

作者： Mauny, Michel INRIA B.P. 105 Le Ckesnay CedexF-78153 France

来源：评论

学校读者我要写书评

暂无评论

Implanting FFP Trees in Binary Trees: An Architectural Proposal 81

Implanting FFP Trees in Binary Trees: An Architectural Propo...

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： MacDavid Tolle, Donald Department of Computer Science University of North Carolina Chapel Hill United States

ISBN: (纸本)0897910605

Mag6 has proposed a computer architecture [1979] that is a radical departure from that of the conventional yon Neumann machine. This paper describes an architecture much like Mag6's in some fundamental ways, yet differing substantially from it in others. The central problem dealt with in both architectures is that of coordination of computation in a very large fixed network of essentially identical processors. Both machines are driven by FFP programs, which can specify a very large number of non-identical, independent concurrent computations. In each machine, the fixed binary tree of machine cells adapts itself dynamically to the changing requirements of the programs being executed, automatically allocating processors and storage space to the computational tasks. In Mag6's machine, most of the complexity and computational power reside in the L cells-the leaf cells of the binary tree. The research described here investigates the possibility of putting more sophisticated computational power in the T cells of the machine, specifically by imposing on the binary tree of machine cells a syntactic structure corresponding closely to that of the FFP program to be executed. That syntactic structure-the embedded SN-CP network-is, in effect, a computer designed and built dynamically and specifically to execute the underlying FFP program. Many highly concurrent and sophisticated computations are rather naturally expressible in terms of operations performed on streams of data flowing through the embedded network. The question of whether the advantages of this approach outweigh the disadvantages (such as the increased complexity of the individual cells) awaits further work. © 1981 Association for Computing Machinery, Inc. All rights reserved.

关键词： Cytology

来源：评论

学校读者我要写书评

暂无评论

programming in Constructive Set Theory: SomeExamples 81

Programming in Constructive Set Theory: SomeExamples

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Nordström, Bengt Laboratory for Programming Methodology Informationsbehandling University of Göteborg Chalmers University of Technology GöteborgS-412 96 Sweden

ISBN: (纸本)0897910605

Per Martin-Löfs Constructive Set Theory is a mathematical language with computation rules. It is primarily designed to be a language for mathematical reasoning. The language has a very simple semantics and its rules have a simple structure. Since it is a language for constructive mathematics, it is possible to execute the proof (the construction of a proposition) as a program. The language can be seen as a programming language without assignments and other side effects. Compared to traditional functional languages it has a very rich type structure in that the type of an expression can completely specify the task of the expres-tion. A sorting algorithm, for instance, can be conventionally specified to have a type sort: List(A) List(A) which is type-correct if sort is any function taking a list as argument and producing a list as result. It is, however, also possible to specify that sort is a function taking a list as argument and producing a sorted permutation of its input as result, i.e. sort:(l/x £ List(A)) (vy tList(A)) (Perm(x,y) x Sorted(y)) The type (or the task) of the program can be read as the proposition (Vx 6 List(A)) (3y e List(A) (Perm(x,y) & Sorted(y)) which is read "for all lists x, there is a sorted permutation y of x". We can prove that this proposition is true, using the rules of the language to construct a program for the task. If the proposition were not true, it would be impossible to find a a program for it and we would have had an impossible task. The types of Constructive Set Theory can be seen as a specification language for the programs, but of course there is only one language, avoiding the complexity of mixing a programming language with a logical language. The similarity (or rather: identity) between a mathematical proof of a given proposition and a program for a given task suggests that programming should be similar to the mathematicians activity of finding proofs. We have illustrated this with an example of how a proof of the Euclidean

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Resource Management in Dataflow 81

Resource Management in Dataflow

引用

1981 conference on functional programming languages and computer architecture, fpca 1981

作者： Catto, A.J. Gurd, J.R. Departamento de Computacao e Estatistica Universidade Federal de Sao Carlos Caixa Postal 384 SP Sao Carlos13560 Brazil Department of Computer Science University of Manchester Oxford Road ManchesterM13 9PL United Kingdom

ISBN: (纸本)0897910605

Recent proposals for nondeterministic facilities in high-level dataflow programming systems have stopped short of giving details of low-level implementation. The underlying machine is assumed to provide basic nondeterministic operations which lead to the required high-level effects. This paper gives details of a practical implementation of one such high-level language, Id {3}, for a specific dataflow computer, the Manchester prototype {11}. It adds to previous work by the authors {7, 8} in which implementations of Communicating Processes {12} and Distributed Processes {5} were proposed. Id is based on an unravelling dataflow interpreter which closely resembles the labelled token scheme used in the Manchester prototype. Thus translation of Id programs into suitable machine code is relatively straightforward. However, instead of requiring complex nondeterministic operators to support resource managers as in {I}, the existing simple matching functions of the Manchester system {8} prove to be adequate. For the non-specialist reader, the Manchester labelled dataflow schema and the resource management constructs of Id are outlined before details of implementation are given. © 1981 ACM

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

The spineless tagless G-machine 89

The spineless tagless G-machine

引用

4th International conference on functional programming languages and computer architecture, fpca 1989

作者： Peyton Jones, Simon L. Salkild, Jon University College London United Kingdom

ISBN: (纸本)0897913280

The Spineless Tagless G-machine is an abstract machine based on graph reduction, designed as a target for compilers for non-strict functional languages. As its name implies, it is a development of earlier work, especially the G-machine and TIM. It has a number of unusual features: the abstract machine code is rather higher-level than is common, al-lowing better code generation;the representation of the graph eliminates most interpretive overheads;vectored returns from data structures give fast case-analysis;and the machine is readily extended for a parallel implementation. © 1989 ACM.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：