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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

9 篇 工学
- 9 篇 计算机科学与技术...
- 9 篇 软件工程
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

3 篇 logic programmin...
3 篇 semantics
1 篇 computer circuit...
1 篇 program analysis
1 篇 functional logic...
1 篇 narrowing
1 篇 programming tech...
1 篇 programming lang...
1 篇 data structures
1 篇 artificial intel...
1 篇 logics and meani...
1 篇 domain theory
1 篇 functional progr...

机构

1 篇 portland state u...
1 篇 departamento de ...
1 篇 katholieke univ ...
1 篇 univ munster d-4...
1 篇 ucm dipartimento...
1 篇 univ politecn va...
1 篇 uclm dept inform...
1 篇 department of co...
1 篇 univ politecn va...
1 篇 tokyo institute ...
1 篇 departamento de ...
1 篇 institute of com...
1 篇 rhein westfal th...
1 篇 univ udine dipar...

作者

1 篇 porto antónio
1 篇 rao prasad
1 篇 taisuke sato
1 篇 vidal g
1 篇 gonzález-moreno ...
1 篇 rodríguez-artale...
1 篇 lópez-fraguas fr...
1 篇 moreno g
1 篇 lux w
1 篇 verbaeten s
1 篇 hortalá-gonzález...
1 篇 antoy s
1 篇 tolmach a
1 篇 caballero rafael
1 篇 johnson ernie
1 篇 aart middeldorp
1 篇 ramakrishnan i.v...
1 篇 hanus m
1 篇 ramakrishnan c.r...
1 篇 alpuente m

语言

11 篇 英文

检索条件"任意字段=4th Fuji International Symposium on Functional and Logic Programming, FLOPS 1999"

共 11 条记录，以下是1-10 订阅

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

详细简洁

排序：

4th fuji international symposium on functional and logic programming, flops 1999

4th Fuji International Symposium on Functional and Logic Pro...

引用

4th fuji international symposium on functional and logic programming, flops 1999

ISBN: (纸本)354066677X

the proceedings contain 23 papers. the special focus in this conference is on functional and logic programming. the topics include: Semantics and types in functional logic programming;type inference for overloading without restrictions, declarations or annotations;partial evaluation and non-interference for object calculi;lazy lexing is fast;a functional-logic perspective of parsing;implementing encapsulated search for a lazy functional logic language;comparison of deforestation techniques for functional programs and for tree transducers;automatic verification based on abstract interpretation;a transformation system for lazy functional logic programs;termination analysis of tabled logic programs using mode and type information;on quasi-reductive and quasi-simplifying deterministic conditional rewrite systems;an interval lattice-based constraint solving framework for lattices;higher order matching for program transformation;automated generalisation of function definitions;an extensional characterization of lambda-lifting and lambda-dropping;using types as approximations for type checking prolog programs;a space efficient engine for subsumption-based tabled evaluation of logic programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Typed higher-order narrowing without higher-order strategies 4th

Typed higher-order narrowing without higher-order strategies

引用

4th fuji international symposium on functional and logic programming (flops 99)

作者： Antoy, S Tolmach, A Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (纸本)354066677X

We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these systems into ordinary (first-order) rewrite systems and the subsequent application of conventional narrowing strategies. Our translation is an adaptation to narrowing of Warren's translation, but unlike similar previous work, we preserve static type information, which has a dramatic effect on the size of the narrowing space. Our approach supports sound, complete, and efficient higher-order narrowing computations in classes of systems larger than those previously proposed.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Semantics and types in functional logic programming 4th

Semantics and types in functional logic programming

引用

4th fuji international symposium on functional and logic programming (flops 99)

作者： González-Moreno, JC Hortalá-González, MT Rodríguez-Artalejo, M UCM Dipartimento Sistemas Informat & Programac Madrid Spain

ISBN: (纸本)354066677X

the rewriting logic CRWL has been proposed as a semantic framework for higher-order functional logic programming, using applicative rewriting systems as programs and lazy narrowing as the goal solving procedure. We present an extension of CRWL with a polymorphic type system, and we investigate the consequences of type discipline both at the semantic level and at the operational level. Semantically, models must be extended to incorporate a type universe. Operationally, lazy narrowing must maintain suitable type information in goals, in order to guarantee well-typed computed answers.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Implementing encapsulated search for a lazy functional logic language 4th

Implementing encapsulated search for a lazy functional logic...

引用

4th fuji international symposium on functional and logic programming (flops 99)

作者： Lux, W Univ Munster D-4400 Munster Germany

ISBN: (纸本)354066677X

A distinguishing feature of logic and functional logic languages is their ability to perform computations with partial data and to search for solutions of a goal. Having a built-in search strategy is convenient but not always sufficient. For many practical applications the built-in search strategy (usually depth-first search via global backtracking) is not well suited. Also the non-deterministic instantiation of unbound logic variables conflicts with the monadic I/O concept, which requires a single-threaded use of the world. A solution to these problems is to encapsulate search via a primitive operator try, which returns all possible solutions to a search goal in a list. In the present paper we develop an abstract machine that aims at an efficient implementation of encapsulated search in a lazy functional logic language.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A semantics for program analysis in narrowing-based functional logic languages 4th

A semantics for program analysis in narrowing-based function...

引用

4th fuji international symposium on functional and logic programming (flops 99)

作者： Hanus, M Lucas, S Rhein Westfal TH Aachen D-52056 Aachen Germany Univ Politecn Valencia DSIC E-46022 Valencia Spain

ISBN: (纸本)354066677X

We introduce a denotational characterization of narrowing, the computational engine of many functional logic languages. We use a functional domain for giving a denotation to the narrowing space associated to a given initial expression under an arbitrary narrowing strategy. Such a semantic description highlights (and favours) the operational notion of evaluation instead of the more usual model-theoretic notion of interpretation as the basis for the semantic description. the motivation is to obtain an abstract semantics which encodes information about the real operational framework used by a given (narrowing-based) functional logic language. Our aim is to provide a general, suitable, and accurate framework for the analysis of functional logic programs.

关键词： domain theory functional logic languages narrowing program analysis semantics

来源：评论

学校读者我要写书评

暂无评论

A transformation system for lazy functional logic programs 4th

A transformation system for lazy functional logic programs

引用

4th fuji international symposium on functional and logic programming (flops 99)

作者： Alpuente, M Falaschi, M Moreno, G Vidal, G Univ Politecn Valencia DSIC Valencia 46022 Spain Univ Udine Dipartimento Matemat & Informat I-33100 Udine Italy UCLM Dept Informat Albacete 02071 Spain

ISBN: (纸本)354066677X

Needed narrowing is a complete operational principle for modern declarative languages which integrate the best features of (lazy) functional and logic programming. We define a transformation methodology for functional logic programs based on needed narrowing. We provide (strong) correctness results for the transformation system w.r.t. the set of computed values and answer substitutions and show that the prominent properties of needed narrowing -namely, the optimality w.r.t. the length of derivations and the number of computed solutions- carry over to the transformation process and the transformed programs. We illustrate the power of the system by taking on in our setting two well-known transformation strategies (composition and tupling). We also provide an implementation of the transformation system which, by means of some experimental results, highlights the benefits of our approach.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A functional-logic perspective of parsing 4th

A functional-logic perspective of parsing

引用

4th fuji international symposium on functional and logic programming, flops 1999

作者： Caballero, Rafael López-Fraguas, Francisco J. Departamento de Sistemas Informáticos y Programación Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)354066677X

Parsing has been a traditional workbench for showing the virtues of declarative programming. Both logic and functional programming claim the ability of writing parsers in a natural and concise *** address here the task from a functional-logic perspective. By modeling parsers as non-deterministic functions we achieve a very natural manner of building parsers, which combines the nicest properties of the functional and logic approaches. In particular, we are able to define parsers within our framework in a style very close to that of functional programming parsers, but using simpler concepts. Moreover, we have moved beyond usual declarative approaches to parsers, since the functional-logic parsers presented here can be considered as truly data values. As an example of this feature we define a function that detects ambiguous grammars. © Springer-Verlag Berlin Heidelberg 1999.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Termination analysis of tabled logic programs using mode and type information 4th

Termination analysis of tabled logic programs using mode and...

引用

4th fuji international symposium on functional and logic programming (flops 99)

作者： Verbaeten, S De Schreye, D Katholieke Univ Leuven Dept Comp Sci Louvain Belgium

ISBN: (纸本)354066677X

Tabled logic programming is receiving increasing attention in the logic programming community. It avoids many of the shortcomings of SLD(NF) execution and provides a more flexible and efficient execution mechanism for logic programs. In particular, tabled execution of logic programs terminates more often than execution based on SLD-resolution. One of the few approaches studying termination of tabled logic programs was developed by Decorte et al. they present necessary and sufficient conditions for two notions of universal termination under SLG-resolution, the resolution principle of tabling: quasi-termination and (the stronger notion of) LG-termination. Starting from these necessary and sufficient conditions, we introduce sufficient conditions which are stated fully at the clause level and axe easy to automatize. To this end, we use mode and type information: we consider simply moded, well-typed programs and queries. We point out how our termination conditions can be automatized, by extending the recently developed constraint-based automatic termination analysis for SLD-resolution by Decorte and De Schreye.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

functional and logic programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Aart Middeldorp Taisuke Sato

ISBN: (数字)9783540479505

ISBN: (纸本)9783540666776

this volume contains the papers presented at the 4th fuji international S- posium on functional and logic programming (flops’99) held in Tsukuba, Japan, November 11–13, 1999, and hosted by the Electrotechnical Laboratory (ETL). flops is a forum for presenting and discussing all issues concerning functional programming, logic programming, and their integration. the sym- sium takes place about every 1.5 years in Japan. Previous flops meetings were held in fuji Susuno (1995), Shonan Village (1996), and Kyoto (1998). 1 there were 51 submissions from Austria ( ),Belgium (2),Brazil(3),China 3 3 1 7 (1), Denmark (2), France (3 ), Germany (8), Ireland (1), Israel ( ), Italy (1 ), 4 3 12 1 Japan (9 ), Korea (1), Morocco (1), the Netherlands (1), New Zealand (1), 3 1 1 3 5 Portugal ( ), Singapore ( ), Slovakia (1), Spain (4 ), Sweden (1), UK (4 ), 2 3 4 6 1 and USA (2 ), of which the program committee selected 21 for presentation. In 4 addition, this volume contains full papers by the two invited speakers, Atsushi Ohori and Mario Rodr´?guez-Artalejo.

关键词： programming Techniques programming Languages, Compilers, Interpreters logics and Meanings of Programs Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

A space efficient engine for subsumption-based tabled evaluation of logic programs 4th

A space efficient engine for subsumption-based tabled evalua...

引用

4th fuji international symposium on functional and logic programming, flops 1999

作者： Johnson, Ernie Ramakrishnan, C.R. Ramakrishnan, I.V. Rao, Prasad Department of Computer Science State University of New York at Stony Brook Stony BrookNY11794-4400 United States

ISBN: (纸本)354066677X

Tabled resolution improves efficiency as well as termination properties of logic programs by sharing answer computations across "similar" subgoals. Similarity based on subsumption of subgoals rather than variance (i.e., identity modulo variable renaming) promotes more aggressive sharing, but requires mechanisms to index answers from dynamically growing sets. Earlier we proposed Dynamic threaded Sequential Automata (DTSA) as the data structure for organizing answer tables in subsumption-based tabling. Using a DTSA, we can retrieve answers one at a time from the table, strictly in the order of their insertion. Although DTSA performed very well, its space usage was high. Here we present an alternative data structure called Time-Stamped Trie (TST) that relaxes the retrieval order, and yet ensures that all answers will be eventually retrieved. We show that TST has superior space performance to DTSA in theory as well as practice, without sacrificing time performance. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：