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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

164 篇 会议
12 篇 期刊文献
11 册 图书

馆藏范围

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

日期分布

学科分类号

122 篇 工学
- 109 篇 计算机科学与技术...
- 78 篇 软件工程
- 10 篇 电气工程
- 6 篇 电子科学与技术（可...
- 5 篇 信息与通信工程
- 5 篇 控制科学与工程
- 2 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 土木工程
- 1 篇 轻工技术与工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
- 1 篇 生物工程
- 1 篇 安全科学与工程
37 篇 理学
- 28 篇 数学
- 8 篇 物理学
- 3 篇 化学
- 2 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
7 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 1 篇 工商管理
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 农学
- 1 篇 作物学

主题

36 篇 logic programmin...
13 篇 functional progr...
9 篇 logic
9 篇 programming lang...
8 篇 mathematical log...
8 篇 logics and meani...
7 篇 software enginee...
7 篇 artificial intel...
6 篇 computer science
5 篇 programming tech...
5 篇 probabilistic lo...
5 篇 clocks
4 篇 fuzzy logic
4 篇 parallel process...
4 篇 formal logic
4 篇 programming
4 篇 semantics
4 篇 logic devices
4 篇 hardware
4 篇 haskell

机构

2 篇 ruleml inc on
2 篇 nasa ames resear...
2 篇 institut für inf...
2 篇 iohk edinburgh m...
2 篇 fraunhofer fokus...
2 篇 iohk ottawa on
2 篇 univ edinburgh e...
2 篇 department of co...
2 篇 fub inst comp sc...
2 篇 iohk mannheim
2 篇 dpto. de sistema...
2 篇 iohk england
2 篇 tech univ dresde...
2 篇 corp semant web ...
2 篇 iohk utrecht
2 篇 iohk glasgow lan...
2 篇 new mexico state...
2 篇 cau kiel inst in...
2 篇 chalmers univ te...
1 篇 univ tokyo grad ...

作者

5 篇 hanus michael
3 篇 pontelli enrico
3 篇 antoy sergio
2 篇 chakravarty manu...
2 篇 mow douglas a.
2 篇 braßel bernd
2 篇 saad emad
2 篇 current k.wayne
2 篇 mackenzie kennet...
2 篇 paschke adrian
2 篇 vinogradova poli...
2 篇 mueller jann
2 篇 herbert kuchen
2 篇 nilsson henrik
2 篇 jones michael pe...
2 篇 guild n.c.f.
2 篇 baldwin j.f.
2 篇 wadler philip
2 篇 meseguer jose
2 篇 melkonian oresti...

语言

179 篇 英文
5 篇 其他
3 篇 中文

检索条件"任意字段=9th International Symposium on Functional and Logic Programming"

共 187 条记录，以下是141-150 订阅

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

详细简洁

排序：

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP '97

9th International Symposium on Programming Languages: Implem...

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

ISBN: (纸本)9783540633983

the proceedings contain 20 papers. the special focus in this conference is on programming languages: implementations, logics, and programs. the topics include: Narrowing the narrowing space;an object calculus with algebraic rewriting;inheritance and selective method dispatching in concurrent Haskell;overriding operators in a mixinbased framework;resolution for logic programming with universal quantifiers;a declarative approach to concurrent programming;transformation of divide & conquer to nested parallel loops;transforming lazy functions using comportment properties;transformations for efficient evaluations in functional programming;inline expansion;higherorder value flow graphs;intuitionistic implication in abstract interpretation;an openended finite domain constraint solver;semantics and compilation of recursive sequential streams in 81/2;implementation of term rewritings with the evaluation strategy;reflections on reflections;evaluation under lambda abstraction;selective recomputation for handling sideeffects in parallel logic programs;tracing lazy functional computations using redex trails and functional programming and geometry.

关键词：

来源：评论

学校读者我要写书评

暂无评论

logic implemented functionally 9

Logic implemented functionally

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Eisinger, Norbert Geisler, Tim Panne, Sven Institut für Informatik Universität München Oettingenstr. 67 MünchenD-80538 Germany

ISBN: (纸本)9783540633983

We describe a course intended to introduce second-year undergraduates to medium-scale programming. the project of the course is to implement a nonconventional logic programming language using a functional implementation language. this exercise reinforces two declarative paradigms and puts the students in experimental touch with a wide range of standard computer science concepts. Declarativity is decisive in making this wide range possible. © Springer international Publishing AG, Part of Springer Science+Business Media.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Narrowing the narrowing space 9

Narrowing the narrowing space

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Antoy, Sergio Ariola, Zena M. Portland State University United States University of Oregon United States

ISBN: (纸本)9783540633983

We introduce a framework for managing as a whole the space of a narrowing computation. the aim of our framework is to find a finite representation of an infinite narrowing space. this, in turn, allows us to replace an infinite enumeration of computed answers with an equivalent finite representation. We provide a semidecidable condition for this result. Our framework is intended to be used by implementations of functional logic programming languages. Our approach borrows from the memoization technique used in the implementation of functional languages. Since narrowing adds non-determinism and unifiers to functional evaluation, we develop a new approach based on graphs to memoize the outcome of a goal. © Springer international Publishing AG, Part of Springer Science+Business Media.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Where Do I Begin? A problem solving approach in teaching functional programming 9

Where Do I Begin? A problem solving approach in teaching fun...

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： thompson, Simon Computing Laboratory University of Kent at Canterbury United Kingdom

ISBN: (纸本)9783540633983

this paper introduces a problem solving method for teaching functional programming, based on Polya’s How To Solve It, an introductory investigation of mathematical *** first present the language independent version, and then show in particular how it applies to the development of programs in *** method is illustrated by a sequence of examples and a larger case study. © Springer international Publishing AG, Part of Springer Science+Business Media

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Resolution for logic programming with universal quantifiers 9

Resolution for logic programming with universal quantifiers

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Bowers, Antony F Hill, Patricia M Ibañez, Francisco University of Bristol BS8 lUB United Kingdom University of Leeds LS2 9JT United Kingdom Universidad Nacional de San Juan Argentina

ISBN: (纸本)9783540633983

It is clearly desirable that logical specifications and the programs that implement them should be as close as possible. Such a claim is often made in support of the logic programming paradigm. However, SLD-resolution, the basic procedural semantics for logic programming, is only defined for programs whose statements are Horn clauses. Most research for extending the Horn clause framework has been concerned with allowing negative literals in the bodies of the statements where SLD-resolution is extended with negation-as-failure. However, one of the main components of first order logic not allowed in clauses is (explicit) quantification. this paper addresses this problem by showing how SLD- resolution can be extended to allow for universally quantified implication formulas as conjuncts in the body of the statements. It will be shown that this technique includes negation-as-failure as a degenerate case. © Springer international Publishing AG, Part of Springer Science+Business Media

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Transformations for efficient evaluations in functional programming* 9

Transformations for efficient evaluations in functional prog...

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Lucas, Salvador Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Camino de Vera S/n ValenciaE 46071 Spain

ISBN: (纸本)9783540633983

Rewriting is a suitable mechanism to implement functional programming languages. the definition of efficient evaluation strategies is a natural concern in this setting. Recently we have shown that, by imposing some simple restrictions on the replacements which are allowed for the arguments of functions, we can obtain efficient head-evaluations of terms in a certain class of programs. We are also able to completely evaluate terms, but in this case, the efficiency of computation can be compromised. this paper concerns the definition of program transformations that enable efficient but still complete evaluation of function calls. © Springer international Publishing AG, Part of Springer Science+Business Media.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

functional programming and geometry 9

Functional programming and geometry

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Cousineau, Guy Laboratoire d’Informatique Ecole Nornale Supérieure 45 rue d’Ulm PARIS CEDEX75251 05 France

ISBN: (纸本)9783540633983

this paper is based on an experience in teaching functional programming to mathematics students. this experience had two objectives. the first one was to help the student assimilate some mathematical concepts by putting them to practical use in programs. the second one was to give them a good start in programming by emphasizing the fact that abstraction, which is so useful in mathematics, is equally useful in programming and allows for more powerful and more easily extensible programs. the mathematical domain used here is geometry and more precisely geometrical transformations, and their group structure. the programming projects are oriented towards 2D tilings, both Euclidean and hyperbolic. © Springer international Publishing AG, Part of Springer Science+Business Media

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

A declarative approach to concurrent programming 9

A declarative approach to concurrent programming

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Gregory, Steve Department of Computer Science University of Bristol BristolBS8 1UB United Kingdom

ISBN: (纸本)9783540633983

Tempo is a language based on classical first-order logic, which can be used for both specifying and implementing concurrent systems. As a declarative programming language, it is unique in that a program explicitly specifies the safety properties that it satisfies. Unlike most specification languages, a Tempo specification of a concurrent system can be executed, also concurrently. An earlier paper presented a subset of Tempo, in which simple synchronization problems could be expressed by precedence relations between events. In this paper we describe a major extension to the language which greatly increases its expressive power. In particular, the language now includes facilities to perform computation — data values, operations on them, and control features — as well as synchronization. © Springer international Publishing AG, Part of Springer Science+Business Media.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

Inheritance and selective method dispatching in concurrent Haskell 9

Inheritance and selective method dispatching in concurrent H...

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Gallardo, José E. Gutierréz, Francisco Ruiz, Bias C. Dpto. de Lenguajes y Ciencias de la Computatión E.T.S.I. Informática Campus Teatinos Málaga29071 Spain

ISBN: (纸本)9783540633983

We incorporate object oriented features into the functional language Haskell: inheritance and methods with super and self references. Parametric polymorphism is retained in object classes. Interfaces are used to describe protocols (as a set of overloaded functional methods) and methods can be defined by default. Object classes implement (or inherit) interface methods. these classes and interfaces are organised in a hierarchical structure. We have integrated our model with Concurrent Haskell. the integrity of object attributes can be guaranteed via a guarded construct, which can also be used to selectively accept messages, depending on the object state and message arguments. the synchronisation mechanism is shown by examples. Our model offers a way out from the inheritance anomaly problem in most cases by incorporating synchronisation constraints into the inheritance hierarchy. © Springer international Publishing AG, Part of Springer Science+Business Media.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Selective recomputation for handling side-effects in parallel logic programs 9

Selective recomputation for handling side-effects in paralle...

引用

9th international symposium on programming Languages: Implementations, logics, and Programs, PLILP 1997, Including a Special Track on Declarative programming Languages in Education

作者： Huang, Zhiyi Sun, Chengzheng Sattar, Abdul Knowledge Representation and Reasoning Unit School of Computing and Information Technology Griffith University NathanQLD4111 Australia

ISBN: (纸本)9783540633983

In contrast to merely AND- and merely OR- parallel execution models/systems, the side-effectproblem in AND/OR parallel execution of Prolog programs is intricate and need to be carefully investigated. To decrease the non-trivial recomputation occurred in previous approach, this paper presents a Selective Recomputation(SR) approach for handling side-effects in the OR-forest model which can exploit both AND- and OR- parallelism. Firstly, the background and motivation is introduced. Secondly, the complex side-effects orderings in AND/OR parallel execution models/systems are clearly described using an innovative concept - side- effect execution permit token. thirdly, recomputation line is proposed to divide an AND-parallel child tree into non-recomputation part and recomputation part. therefore, the recomputation is only confined to the recomputation part of an AND-parallel child tree, instead of the entire tree. And the non-recomputation part can be explored in parallel as pure child tree. Finally, by adopting the delayed execution of soft side-effect built-ins, the non-recomputation part is enlarged and thus the recomputation is minimized and parallelism is maximized. through comparison and analysis, we conclude the SR approach can solve the side-effect problem with minimum recomputation and maximum parallelism. the idea of SR is applicable to other AND/OR parallel execution models/systems as well. © Springer international Publishing AG, Part of Springer Science+Business Media

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：