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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7 篇 会议

馆藏范围

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

日期分布

学科分类号

4 篇 工学
- 4 篇 计算机科学与技术...
- 4 篇 软件工程

主题

1 篇 computer circuit...
1 篇 space research
1 篇 logic programmin...
1 篇 calculations

机构

2 篇 univ complutense...
1 篇 inria bordeaux s...
1 篇 inria rennes bre...
1 篇 univ complutense...
1 篇 univ complutense...

作者

2 篇 castineiras igna...
1 篇 lopez-fraguas fr...
1 篇 del vado virseda...
1 篇 kirchner helene
1 篇 rodriguez-hortal...
1 篇 kirchner florent
1 篇 saenz-perez fern...
1 篇 kirchner claude
1 篇 martin-martin en...

语言

7 篇 英文

检索条件"任意字段=18th International Workshop on Functional and Constraint Logic Programming, WFLP 2009"

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

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

详细简洁

排序：

22nd international Conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on functional and constraint logic programming, wflp 2019

22nd International Conference on Applications of Declarative...

引用

22nd international Conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd workshop on logic programming, WLP 2019, and the 27th workshop on functional and constraint logic programming, wflp 2019

ISBN: (纸本)9783030467135

the proceedings contain 18 papers. the special focus in this conference is on Applications of Declarative programming and Knowledge Management. the topics include: Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order logic;KBSET – Knowledge-Based Support for Scholarly Editing and Text Processing with Declarative Markup and a Core Written in SWI-Prolog;structured Traversal of Search Trees in constraint-logic Object-Oriented programming;performance Analysis of Zippers;adding Data to Curry;free theorems Simply, via Dinaturality;Improving the Performance of the Paisley Pattern-Matching EDSL by Staged Combinatorial Compilation;ICurry;a Process Calculus for Formally Verifying Blockchain Consensus Protocols;modular Modeling and Optimized Scheduling of Building Energy Systems Based on Mixed Integer programming;finding Maximal Non-redundant Association Rules in Tennis Data;from Textual Information Sources to Linked Data in the Agatha Project;allen’s Interval Algebra Makes the Difference;exploring Properties of Icosoku by constraint Satisfaction Approach;the Regularization of Small Sub-constraint Satisfaction Problems;declarative programming for Microcontrollers - Datalog on Arduino.

关键词：

来源：评论

学校读者我要写书评

暂无评论

functional and constraint logic programming - 18th international workshop, wflp 2009, Revised Selected Papers

Functional and Constraint Logic Programming - 18th Internati...

引用

18th international workshop on functional and constraint logic programming, wflp 2009

ISBN: (纸本)3642119980

the proceedings contain 11 papers. the topics discussed include: programming with multiple paradigms in Lua;constraint based strategies;termination of context-sensitive rewriting with built-in numbers and collection data structures;semantic labeling for proving termination of combinatory reduction systems;a taxonomy of some right-to-left string-matching algorithms;type checking and inference are equivalent in lambda calculi with existential types;fast and accurate strong termination analysis with an application to partial evaluation;new results on type systems for functional logic programming;a simple region inference algorithm for a first-order functional language;and theoretical framework for the declarative debugging of functional logic programs with lambda abstractions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Integrating ILOG CP Technology into Toy

Integrating ILOG CP Technology into Toy

引用

18th international workshop on functional and constraint logic programming

作者： Castineiras, Ignacio Saenz-Perez, Fernando Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain Univ Complutense Madrid Dept Ingn Soft Inteligencia Artificial E-28040 Madrid Spain

ISBN: (纸本)9783642119989

the constraint functional logic programming system TOY has been using the SICStus Prolog finite domain (FD) constraint solver. In this work, we show how to integrate the ILOG CP FD constraint solving technology into this system, with the aim of improving its application domain and performance. We describe our implementation emphasizing the synchronization between Herbrand computations in the Toy side and FD constraint solving in the ILOG CP side. Finally, performance results are reported and discussed.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

constraint Based Strategies

Constraint Based Strategies

引用

18th international workshop on functional and constraint logic programming

作者： Kirchner, Claude Kirchner, Florent Kirchner, Helene INRIA Bordeaux Sud Ouest Ctr Rech INRIA 351 Cours Liberat F-33405 Talence France INRIA Rennes Bretagne Atlantic Ctr Rech INRIA 351 Cours Liberat F-33405 Talence France

ISBN: (纸本)9783642119989

Numerous computational and deductive frameworks use the notion of strategy to guide reduction and search space exploration, making the macro scale control of micro operations an explicit object of interest. In recent works, abstract strategies have been defined in extension but also intensionally. In this paper we complete these views with a new declarative approach based on constraints, which are used to model the different parts of a strategy. this procedure allows us to express elaborate strategies in a declarative and reusable way.

关键词： Space research

来源：评论

学校读者我要写书评

暂无评论

New Results on Type Systems for functional logic programming

New Results on Type Systems for Functional Logic Programming

引用

18th international workshop on functional and constraint logic programming

作者： Lopez-Fraguas, Francisco J. Martin-Martin, Enrique Rodriguez-Hortala, Juan Univ Complutense Madrid Dept Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642119989

Type systems are widely used in programming languages as a powerful tool providing safety to programs, and forcing the programmers to write code in a clearer way. functional logic languages have inherited Damas & Milner type system from their functional part due to its simplicity and popularity. In this paper we address a couple of aspects that can be subject of improvement. One is related to a problematic feature of functional logic languages not taken under consideration by standard systems: it is known that the use of opaque HO patterns in left-hand sides of program rules may produce undesirable effects from the point of view of types. We re-examine the problem, and propose a Damas & Milner-like type system where certain uses of HO patterns (even opaque) are permitted while preserving type safety, as proved by a subject reduction result that uses HO-let-rewriting, a recently proposed reduction mechanism for HO functional logic programs. the other aspect is the different ways in which polymorphism of local definitions can be handled. At the same time that we formalize the type system, we have made the effort of technically clarifying the overall process of type inference in a whole program.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

A theoretical Framework for the Declarative Debugging of functional logic Programs with Lambda Abstractions

A Theoretical Framework for the Declarative Debugging of Fun...

引用

18th international workshop on functional and constraint logic programming

作者： del Vado Virseda, Rafael Castineiras, Ignacio Univ Complutense Madrid Dpto Sistemas Informat & Computac E-28040 Madrid Spain

ISBN: (纸本)9783642119989

In this paper, we extend the well-known Naish's declarative debugging scheme for diagnosing wrong computed answers in first-order lazy functional-logic programs to the higher-order setting of the simply typed A-calculus, where programs are presented by conditional pattern rewrite systems. Our approach generalizes and combines declarative debugging techniques previously developed for less expressive declarative programming paradigms involving applicative rewrite rules instead of A-abstractions and decidable higher-order unification. Debugging starts with the observation of a wrong computed answer which the user regards as incorrect w.r.t. an intended model that provides a declarative description of the program's semantics. Debugging proceeds by exploring an abridged proof tree built on a higher-order rewriting logic with A-abstractions that provides a purely declarative view of the computation. Finally, debugging ends with the detection of a defined function rule in the program that is incorrect w.r.t. the intended model. We prove the logical correctness of the debugging method for any sound goal solving system whose computed answers are logical consequences of the program.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Computer Science logic - 23rd international workshop, CSL 2009 - 18th Annual Conference of the EACSL, Proceedings

Computer Science Logic - 23rd International Workshop, CSL 20...

引用

23rd international workshop on Computer Science logic, CSL 2009 - 18th Annual Conference of the EACSL

ISBN: (纸本)3642040268

the proceedings contain 37 papers. the topics discussed include: functional interpretations of intuitionistic linear logic;fixed-point definability and polynomial time;Kleene's amazing second recursion theorem;jumping boxes: representing Lambda-calculus boxes by jumps;tree-width for first order formulae;algorithmic analysis of array-accessing programs;decidable relationships between consistency notions for constraint satisfaction problems;cardinality quantifiers in MLO over trees;from coinductive proofs to exact real arithmetic;on the relation between sized-types based termination and semantic labelling;expanding the realm of systematic proof theory;intersection, universally quantified, and reference types;linear game automata: decidable hierarchy problems for stripped-down alternating tree automata;enriching an effect calculus with linear types;degrees of undecidability in term rewriting;upper bounds on stream I/O using semantic interpretations;and efficient type-checking for amortised heap-space analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：