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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

An architecture for mostly functional languages 86

An architecture for mostly functional languages

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Knight, Tom Symbolics Inc. M.I.T. Artificial Intelligence Laboratory CambridgeMA United States

ISBN: (纸本)0897912004

The addition of small amounts of special purpose hardware to conventional machines increases the efficiency of lisp systems with dynam, type checks. In a similar way, this paper proposes additional hardware to dynamically check the correctness of parallel execution of lisp programs. The key idea is the use of fully associative caches as a means of maintaining and enforcing a set of dependencies between portions of the program. © 1986 acm.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

lisp on a reduced-instruction-set-processor 86

LISP on a reduced-instruction-set-processor

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Steenkiste, Peter Hennessy, John Computer Systems Laboratory Stanford University United States

ISBN: (纸本)0897912004

We ported the Portable Standard lisp compiler to MIPS-X, a reduced-instruction-tet processor. In this paper we report on a number of profiling measurements made on a set of 11 lisp programs. The meaturemenU give information on two levels. Fuit, we look at what instructions lisp programs use at the assembly level. Because the instruction set of MIPS-X contains only very simple, bask instructions, the profiling information is at a very low level. In a second group of measurements, we determine how much time each program spends on the most common primitive lisp operations. Because MIPS-X executes all machine instructions in a single cycle, it is possible to get very accurate timing measurements by instruction counts. © 1986 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Design of an optimising, dynamically retargetable compiler for common lisp

Design of an optimising, dynamically retargetable compiler f...

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Brooks, Rodney A. Posner, David B. McDonald, James L. White, Jon L. Benson, Eric Gabriel, Richard P. Massachusetts Institute of Technology Lucid Inc. United States

ISBN: (纸本)0897912004

We outline the components of a retargetable cross-compiler for the Common lisp language. A description is given of a method for modeling the various hardware features in the compiler's database, and a breakdown is shown of the compiler itself into various machine-independent and machine-dependent modules. A novel feature of this development is the dynam, nature of the retargeting: Databases for multiple hardware architectures are a standard part of the compiler, and the internal interfaces used by the compiler are such that the machine-dependent modules may be instantly switched from one to another. Examples of generated code in several environments will be given to demonstrate the high quality of the output available, even under this very modular approach. © 1986 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Integrating functional and imperative programming 86

Integrating functional and imperative programming

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Gifford, David K. Lucassen, John M. MIT Laboratory for Computer Science 545 Technology Square CambridgeMA02139 United States

ISBN: (纸本)0897912004

We present a class of programming languages that enables the advantages of functional and imperative computation to be combined within a single program. These languages, which we call fluent languages, have distinct sublanguages for functional and imperative programming. Sublanguage invariants are verified by a stat, checking system that simultaneously determines the type and the effect class of every expression. Effect checking is similar to type checking, but it is used to guarantee side-effect invariants instead of value invariants. Effect checking also makes it possible to implement polymorphism in a general, type-safe and efficient manner despite the presence of side-effects. Preliminary simulation results suggest that fluent programs are well suited for parallel processing. © 1986 acm.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Experience with an uncommon lisp 86

Experience with an uncommon lisp

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Alberga, Cyril N. Bosman-Clark, Chris Mikelsons, Martin Van Deusen, Mary S. Padget, Julian IBM T. J. Watson Research Center Computer Science Department Yorktown HeightsNY10598 United States University of Bath School of Mathematics Bath AvonBA2 7AY United Kingdom

ISBN: (纸本)0897912004

In 1974, a group at IBM Research began work on a new implementation of lisp. Because the work was initially done for internal use only, many design decisions led the developers away from the more traditional lisp paths. The most important design decision was to create a language which would have consistent semantics between compilation and interpretation. This paper takes a retrospective look at the decisions we made to see how they have stood up against the test of time and usage, especially when seen against the decisions made for Common lisp. The lisp language issues discussed include scoping, operator evaluation and consistency, and state saving. Compiler issues include the integration of assembly code into lisp programs, our underlying formal semantics, and optimization. Our programming environment is as sophisticated as the majority of lisp systems. Aiming at hardware such as the IBM 3270 terminals has affected the design of the tools that make up this environment. These issues will also be discussed. © 1986 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Connection Machine® lisp: Fine-grained parallel symbolic processing

Connection Machine® Lisp: Fine-grained parallel symbolic pr...

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Steele, Guy L. Hillis, W. Daniel Thinking Machines Corporation 245 First Street CambridgeMA02142 United States

ISBN: (纸本)0897912004

Connection Machine lisp is a dialect of lisp extended to allow a fine-grained, data-oriented style of parallel execution. We introduce a new data structure, the xapping, that is like a sparse array whose elements can be processed in parallel. This kind of processing is suitable for implementation by such fine-grained parallel computers as the Connection Machine System and NON-VON. Additional program notation is introduced to indicate various parallel operations. The symbols α and • are used, in a manner syntactically reminiscent of the backquote notation used in Common lisp, to indicate what parts of an expression are to be executed in parallel. The symbol β is used to indicate permutation and reduction of sets of data. Connection Machine lisp in practice leans heavily on APL and FP and their descendants. Many ideas and stylistic idioms can be carried over directly. Some idioms of Connection Machine lisp are difficult to render in APL because Connection Machine lisp xappings may be sparse while APL vectors are not sparse. We give many small examples of programming in Connection Machine lisp. Two metacircular interpreters for a subset of Connection Machine lisp are presented. One is concise but suffers from defining a in terms of itself in such a way as to obscure its essential properties. The other is longer but facilitates presentation of these properties. © 1986 acm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the use of lisp in implementing denotational semantics: A progress report

On the use of LISP in implementing denotational semantics: A...

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Lee, Peter Pleban, Uwe Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor United States

ISBN: (纸本)0897912004

Automat, compiler generators and semantics systems typically produce compilers which depend heavily on the mechanism of β-reduction. This is particularly true of those systems based on denotational semantics, since their descriptive notations are based on the λ-calculus. Performing productions is expensive, however, and this is a primary reason for the extreme inefficiency of automatically-generated compilers and the code they produce. Since lisp is in many respects similar to the λ-calculus, it seems a reasonable idea to generate compilers which rely on the lisp EVAL function rather than a β-reducer. Then, the expensive simulation of β-reductions is avoided, and the efficiency of lisp is obtained. Unfortunately, moving to lisp is complicated by the fact that the generated compilers quite often depend on a β-reducar's ability to partially evaluate an expression - a capability lacking in lisp. We have implemented a compiler generator called MESS which produces realist, and efficient compilers written in SCHEME. MESS processes modular denotational descriptions, and exploits this modularity in order to avoid the dependence on partial evaluation. An added benefit of our approach is that the output of the generated compilers can be directly processed by an automatically-generated table-driven code generator. This makes it possible to obtain object code which compares favorably with that produced by hand-crafted compilers. Our results thus far are quite encouraging, as we are finding that the compilers generated by MESS are significantly more efficient and realist, than those produced by other systems. © 1986 acm.

关键词： Differentiation (calculus)

来源：评论

学校读者我要写书评

暂无评论

Exact real arithmetic: A case study in higher order programming 86

Exact real arithmetic: A case study in higher order programm...

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Bochm, Hans-J. Cartwrigkt, Robert Riggle, Mark O'Donnell, Michael J. Rice University United States University of Chicago United States

ISBN: (纸本)0897912004

Two methods for implementing exact real arithmet, are explored One method is based on formulating real numbers as functions that map rational tolerances to rational approximations. This approach, which was developed by constructive mathematicians as a concrete formalization of the real numbers, has lead to a surprisingly successful implementation. The second method formulates real numbers as potentially infinite sequences of digits, evaluated on demand. This approach has frequently been advocated by proponents of lazy functional languages in the computer science community Ironically, it leads to much less satisfactory implementations. We discuss the theoretical problems involved in both methods, give algorithms for the bas, arithmet, operations, and give an empirical comparison of the two techniques. We conclude with some general observations about the lazy evaluation paradigm and its implementation. © 1986 acm.

关键词： Rational functions

来源：评论

学校读者我要写书评

暂无评论

Desiderata for the standardisation of lisp

Desiderata for the standardisation of LISP

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Padget, Julian Chailloux, Jérôme Christaller, Thomas DeMantaras, Ramon Dalton, Jeff Devin, Matthieu Fitch, John Krumnack, Timm Neidl, Eugen Papon, Eric Pope, Stephen Queinnec, Christian Steels, Luc Stoyan, Herbert School of Mathematics University of Bath Bath AvonBA2 7AY United Kingdom INRIA Domaine de Vohiceau Rocquencourt Le ChesnayF-78153 France GMD MbH PF 1240. Schloss Birlinghoven St Augustin 1D-5205 Germany CEAB-CSIC Blanes Spain AI Application Institute University of Edinburgh 80 South Bridge EdinburghEH1 1HN United Kingdom Krupp-Atlas-Eleklroaik Poatfach 448545 Bremen 44D-2800 Germany CRCGE Marcoussis France BTS Dept. PCS GmbH Pfälzer-Walf-Str. 36 München 90D-8000 Germany STEI Fort d'Issy Issy-les-MoulineauxF-92131 France AI Lab. Vreis Uai. Brussels Peinlaaa 2 BrusselsB-1050 Belgium IMMD 6 Universität Erlangen Martensstr. 3 Erlangen Germany

ISBN: (纸本)0897912004

This paper reports work-in-progress within the lisp community on efforts to bring the lisp language to national and international standardisation. The paper discusses the objective criteria that have been established, how it is planned that these will be satisfied, when it is expected these will be fulfilled and what is still open. The Common lisp definition has made a very valuable contribution to the standardisation of lisp and the current authors have learned much from that experience. The result is a rationale for how lisp could be standardised along with identification of key features in the language and its environment, which together lead to a layered definition. This is followed by detail of the proposal for lisp standardisation based on the strategies that will have been outlined. © 1986 acm.

关键词： Standardization

来源：评论

学校读者我要写书评

暂无评论

Equation, sets, and reduction semantica for functional and logic programming

Equation, sets, and reduction semantica for functional and l...

引用

1986 acm conference on lisp and functional programming, LFP 1986

作者： Jayaraman, Bharat Silbermann, Frank S.K. Department of Computer Science University of North Cantina at Chapel Hill Chapel HillNC27514 United States

ISBN: (纸本)0897912004

We present a framework for first-order functional and Horn-logic programming using rewrite rules and equations. A program in this framework is a set of rewrite rules followed by a set of equations that need to be solved. These rewrite rules are an extension of the rewrite rules found in non-canonical term-writing systems in that they permit conditions, expressed as a set of equations having logical variables, on the right-hand side of a rule. The reduction semantics of equations is given in terms of complete sets of solutions. An operational strategy which computes these solutions is given in terms of a new technique called object refinement. This semantics is also called the refinement semantics. Object refinement is a generalisation of the outermost reduction rule of functional languages and the unification rule of logic languages. Consistency and completeness theorems are presented in order to establish the equivalence of the reduction and refinement semantics. Since an equation may possess multiple solutions, a set construct is provided to collect these solutions. The resulting language, called EqL, is currently being implemented. Examples are used to illustrate the language constructs and their semantics. The relationship of these ideas to other closely related ideas, notably narrowing, is also discussed. © 1986 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：