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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

154 篇 会议
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

133 篇 工学
- 112 篇 计算机科学与技术...
- 112 篇 软件工程
- 16 篇 电气工程
- 15 篇 仪器科学与技术
- 2 篇 控制科学与工程
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
27 篇 理学
- 25 篇 数学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 地质学
- 1 篇 生物学
9 篇 管理学
- 8 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 法学
- 1 篇 社会学
1 篇 农学
- 1 篇 作物学
1 篇 军事学

主题

31 篇 computer program...
15 篇 functional progr...
13 篇 computer program...
8 篇 lisp (programmin...
8 篇 program compiler...
7 篇 object oriented ...
5 篇 ada (programming...
5 篇 semantics
4 篇 parallel program...
3 篇 programming theo...
2 篇 computer systems...
2 篇 calculations
2 篇 dynamic programm...
2 篇 apl (programming...
2 篇 computer softwar...
2 篇 multiprogramming
1 篇 computer science
1 篇 macro commands
1 篇 programming prof...
1 篇 performance

机构

3 篇 indiana univ blo...
2 篇 ceab-csic blanes
2 篇 ilog gentilly
2 篇 mit laboratory f...
2 篇 xerox parc unite...
2 篇 natl univ of sin...
2 篇 crcge marcoussis
2 篇 xerox palo alto ...
1 篇 yale univ united...
1 篇 computer science...
1 篇 duke univ durham...
1 篇 dept. mathematic...
1 篇 department of co...
1 篇 krupp-atlas-elek...
1 篇 department of co...
1 篇 university of al...
1 篇 univ. of bath ba...
1 篇 tektronix labora...
1 篇 georgia inst tec...
1 篇 indiana universi...

作者

3 篇 gifford david k.
3 篇 queinnec christi...
3 篇 white jon l.
2 篇 davis harley
2 篇 cardelli luca
2 篇 chuang tyng-ruey
2 篇 seniak nitsan
2 篇 lee peter
2 篇 osborne randy b.
2 篇 parquier pierre
2 篇 mohr eric
2 篇 padget julian
2 篇 bobrow daniel g.
2 篇 gabriel richard ...
1 篇 model mitchell l...
1 篇 peyton jones s.l...
1 篇 steele guy l.
1 篇 dalton jeff
1 篇 moore donald r.
1 篇 haikala ilkka j.

语言

155 篇 英文

检索条件"任意字段=Proceedings of the 1992 ACM Conference on Lisp and Functional Programming"

共 155 条记录，以下是81-90 订阅

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

详细简洁

排序：

A COMPOSITIONAL ANALYSIS OF EVALUATION-ORDER AND ITS APPLICATION 90

A COMPOSITIONAL ANALYSIS OF EVALUATION-ORDER AND ITS APPLICA...

引用

1990 CONF ON lisp AND functional programming

作者： DRAGHICESCU, M PURUSHOTHAMAN, S Computer Science Department The Pennsylvania State University University Park PA

ISBN: (纸本)089791368X

We present a compositional definition of the order of evaluation of variables in a lazy first-order functional language. Unlike other published work, our analysis applies to all evaluation strategies which may use strictness information to change the normal (lazy) order of evaluation. At the same time it can be adapted to pure lazy evaluation yielding a sharper analysis in this case. It can also be adapted to take advantage of any information about the order in which primitive functions evaluate their arguments. The time complexity of the method is that of strictness *** also present a compositional definition of the set of variables which denote locations where the result of an expression might be stored. This analysis yields a simple solution to the aliasing *** these two analyses we develop a new algorithm for the destructive update problem.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

CONTINUING INTO THE FUTURE - ON THE INTERACTION OF FUTURES AND FIRST-CLASS CONTINUATIONS 90

CONTINUING INTO THE FUTURE - ON THE INTERACTION OF FUTURES A...

引用

1990 CONF ON lisp AND functional programming

作者： KATZ, M WEISE, D

ISBN: (纸本)089791368X

One of the nicest features of the future construct originally presented in Multilisp [6] is its near orthogonality with respect to a functional subset of Scheme [1]. Introducing futures into most functional programs does not affect the value returned, even though the parallel execution order might differ from the sequential. When futures and continuations are used in the same program, however, parallel and sequential executions can yield different results. No existing implementation of futures has yet addressed this issue. We make futures and continuations interact properly through a simple, yet important, change to the implementation of the future construct. This change causes a second problem to manifest itself: the creation of extraneous computation threads. The second problem is addressed by making an additional change to the future construct. This paper begins with a brief introduction to futures and continuations. An explanation as to why current implementations of the future construct fail to handle continuations properly and our proposed solution follows. How this solution leads to extraneous computation threads and our approach to eliminating them is then presented. The paper concludes with an analysis of our final solution and a discussion of potential future research directions.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Static dependent types for first class modules 90

Static dependent types for first class modules

引用

proceedings of the 1990 acm conference on lisp and functional programming

作者： Sheldon, Mark A. Gifford, David K. Massachusetts Inst of Technology MA United States

ISBN: (纸本)089791368X

Static dependent types are the basis of a new type system that permits types and values to be packaged together into first class modules. Unlike other approaches to modules, static dependent types permit unrestricted access to the types and values in first class modules without sacrificing static type checking or data abstraction. Static dependent types are type safe in the presence of side effects because they rely on an effect system that can make deductions conventional type systems cannot. Experience with an implementation, built as an extension to the FX-87 programming language, shows that static dependent types can be used for building large systems.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Representation of lambda terms suitable for operations on their intensions

Representation of lambda terms suitable for operations on th...

引用

proceedings of the 1990 acm conference on lisp and functional programming

作者： Nadathur, Gopalan Wilson, Debra Sue Duke Univ Durham United States

ISBN: (纸本)089791368X

A representation for lambda terms is described based on the scheme of de Bruijn for eliminating variable names. The new notation provides for a class of terms that can encode other terms together with substitutions to be performed on them. The notion of an environment is used to realize this 'delaying' of substitutions. The precise mechanism that is used is, however, more complex than the usual so as to support the ability to examine subterms embedded under abstractions. A virtue of our representation is that it permits substitution to be realized as an atomic operation and thereby provides for efficient implementations of β-reduction. Operations on λ-terms are described based on our representation and the relationship of these to the conventional definitions are exhibited.

关键词： Computer programming Languages

来源：评论

学校读者我要写书评

暂无评论

Semantic basis for quest

Semantic basis for quest

引用

proceedings of the 1990 acm conference on lisp and functional programming

作者： Cardelli, Luca Longo, Giuseppe DEC Systems Research Cent

ISBN: (纸本)089791368X

The authors focus on the Quest type system, describing and modeling its most interesting features. At the core of this system is a three-level structure of kinds, types (and type operators), and values. Within this structure they accommodate impredicative type quantifiers and subtyping. Universal type quantifiers can then be used to model type operators, polymorphic functions, and ordinary higher-order functions. Existential type quantifiers can model abstract types. Subtyping supports (multiple) inheritance, and in combination with quantifiers results in bounded-polymorphic functions and partially abstract types. Subtyping is realized in a uniform way throughout the system via a notion of 'power kind'.

关键词： Computer programming Languages

来源：评论

学校读者我要写书评

暂无评论

BINDING TIME ANALYSIS FOR HIGHER-ORDER UNTYPED functional LANGUAGES

BINDING TIME ANALYSIS FOR HIGHER-ORDER UNTYPED FUNCTIONAL LA...

引用

1990 CONF ON lisp AND functional programming

作者： CONSEL, C Yale Univ United States

ISBN: (纸本)089791368X

When some inputs of a program are known at compile-time, certain expressions can be processed statically;this is the basis of the notion of partial evaluation. Identifying these early computations can be determined independently of the actual values of the input by a static analysis called binding time analysis. Then, to process a program, one simply follows the binding time information: evaluate compile-time expressions and defer the others to run-time. Using abstract interpretation, we present a binding time analysis for an untyped functional language which provides an effective treatment of both higher order functions and data structures. To our knowledge it is the first such analysis. It has been implemented and is used in a partial evaluator for a side-effect free dialect of Scheme. The analysis is general enough, however, to be valid for non-strict typed functional languages such as Haskell. Our approach and the system we have developed solve and go beyond the open problem of partially evaluating higher order functions described in [3] since we also provide a method to handle data structures. Our analysis improves on previous work [5, 15, 4] in that: (1) it treats both higher order functions and data structures, (2) it does not impose syntactic restrictions on the program being processed, and (3) it does not require a preliminary phase to collect the set of possible functions that may occur at each site of application.

关键词： Computer programming Languages

来源：评论

学校读者我要写书评

暂无评论

FROM OPERATIONAL SEMANTICS TO ABSTRACT MACHINES - PRELIMINARY-RESULTS 90

FROM OPERATIONAL SEMANTICS TO ABSTRACT MACHINES - PRELIMINAR...

引用

1990 CONF ON lisp AND functional programming

作者： HANNAN, J MILLER, D Department of Computer and Information Science University of Pennsylvania Philadelphia PA

ISBN: (纸本)089791368X

The operational semantics of functional programming languages is frequently presented using inference rules within simple meta-logics. Such presentations of semantics can be high-level and perspicuous since meta-logics often handle numerous syntactic details in a declarative fashion. This is particularly true of the meta-logic we consider here, which includes simply typed λ-terms, quantification at higher types, and β-conversion. Evaluation of functional programming languages is also often presented using low-level descriptions based on abstract machines: simple term rewriting systems in which few high-level features are present. In this paper, we illustrate how a high-level description of evaluation using inference rules can be systematically transformed into a low-level abstract machine by removing dependencies on high-level features of the meta-logic until the resulting inference rules are so simple that they can be immediately identified as specifying an abstract machine. In particular, we present in detail the transformation of two inference rules specifying call-by-name evaluation of the untyped λ-calculus into the Krivine machine, a stack-based abstract machine that implements such evaluation. The initial specification uses the meta-logic's β-conversion to perform substitutions. The resulting machine uses de Bruijn numerals and closures instead of formal substitution. We also comment on a similar construction of a simplified SECD machine implementing call-by-value evaluation. This approach to abstract machine construction provides a semantics-directed method for motivating, proving correct, and extending such abstract machines.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Compositional analysis of evaluation-order and its application

Compositional analysis of evaluation-order and its applicati...

引用

proceedings of the 1990 acm conference on lisp and functional programming

作者： Draghicescu, Mircea Purushothaman, S. Pennsylvania State Univ University Park United States

ISBN: (纸本)089791368X

We present a compositional definition of the order of evaluation of variables in a lazy first-order functional language. Unlike other published work, our analysis applies to all evaluation strategies which may use strictness information to change the normal (lazy) order of evaluation. At the same time it can be adapted to pure lazy evaluation yielding a sharper analysis in this case. It can also be adapted to take advantage of any information about the order in which primitive functions evaluate their arguments. The time complexity of the method is that of strictness analysis. We also present a compositional definition of the set of variables which denote locations where the result of an expression might be stored. This analysis yields a simple solution to the aliasing problem. Using these two analyses we develop a new algorithm for the destructive update problem.

关键词： Computer programming Languages

来源：评论

学校读者我要写书评

暂无评论

Speculative computation in multilisp. An overview

Speculative computation in multilisp. An overview

引用

proceedings of the 1990 acm conference on lisp and functional programming

作者： Osborne, Randy B. Cambridge Research Lab Cambridge United States

ISBN: (纸本)089791368X

We present experimental evidence that performing computations in parallel before their results are known to be required can yield performance improvements over conventional approaches to parallel computing. We call such eager computation of expressions speculative computation, as opposed to conventional mandatory computation that is used in almost all contemporary parallel programming languages and systems. The two major requirements for speculative computation are: 1) a means to control computation to favor the most promising computations and 2) a means to abort computation and reclaim computation resources. We discuss these requirements in the parallel symbolic language Multilisp and present a sponsor model for speculative computation in Multilisp which handles control and reclamation of computation in a single, elegant framework. We outline an implementation of this sponsor model and present performance results for several applications of speculative computation. The results demonstrate that our support for speculative computation adds expressive and computational power to Multilisp, with observed performance improvement as great as 26 times over conventional approaches to parallel computation.

关键词： Computer programming Languages

来源：评论

学校读者我要写书评

暂无评论

A technique for increasing the granularity of parallel programs

A technique for increasing the granularity of parallel progr...

引用

proceedings of the 1990 acm conference on lisp and functional programming

作者： Mohr, Eric Kranz, David A. Halstead Jr., Robert H.

ISBN: (纸本)089791368X

Many parallel algorithms are naturally expressed at a fine level of granularity, often finer than a MIMD parallel system can exploit efficiently. Most builders of parallel systems have looked to either the programmer or a parallelizing compiler to increase the granularity of such algorithms. In this paper we explore a third approach to the granularity problem by analyzing two strategies for combining parallel tasks dynamically at run-time. We reject the simpler load-based inlining method, where tasks are combined based on dynamic load level, in favor of the safer and more robust lazy task creation method, where tasks are created only retroactively as processing resources become available. These strategies grew out of work on Mul-T [14], an efficient parallel implementation of Scheme, but could be used with other applicative languages as well. We describe our Mul-T implementations of lazy task creation for two contrasting machines, and present performance statistics which show the method's effectiveness. Lazy task creation allows efficient execution of naturally expressed algorithms of a substantially finer grain than possible with previous parallel lisp systems.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共16页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：