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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

12 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

4 篇 logic programmin...
2 篇 implementation
1 篇 performance
1 篇 constraint logic...
1 篇 software enginee...
1 篇 call-by-need
1 篇 tabling
1 篇 guidance
1 篇 control
1 篇 calculations
1 篇 mathematical log...
1 篇 logic variables
1 篇 programming tech...
1 篇 deques
1 篇 duality of compu...
1 篇 lambda mu-calcul...
1 篇 sequent calculus
1 篇 queues
1 篇 domain cooperati...
1 篇 programming lang...

机构

1 篇 univ minho dept ...
1 篇 natl inst inform...
1 篇 univ politecn ma...
1 篇 univ complutense...
1 篇 univ complutense...
1 篇 univ melbourne d...
1 篇 univ gothenburg ...
1 篇 univ complutense...
1 篇 dept. of applied...
1 篇 univ texas dalla...
1 篇 inria paris rocq...
1 篇 univ tokyo
1 篇 univ complutense...
1 篇 imdea software i...
1 篇 portland state u...
1 篇 tallinn univ ins...
1 篇 nicta victoria r...
1 篇 univ paris dider...
1 篇 vienna univ tech...
1 篇 dept. of compute...

作者

2 篇 saenz-perez fern...
1 篇 novais paulo
1 篇 kriener jael
1 篇 nakata keiko
1 篇 carro manuel
1 篇 bouma gerlof
1 篇 triska markus
1 篇 saurin alexis
1 篇 tom schrijvers
1 篇 ramos joao
1 篇 herbelin hugo
1 篇 ariola zena m.
1 篇 peter thiemann
1 篇 antoy sergio
1 篇 correas fernande...
1 篇 peters arthur
1 篇 estevez-martin s...
1 篇 satoh ken
1 篇 neves jose
1 篇 stuckey peter

语言

13 篇 英文

检索条件"任意字段=11th International Symposium onFunctional and Logic Programming, FLOPS 2012"

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

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

详细简洁

排序：

Functional and logic programming - 11th international symposium, flops 2012, Proceedings

Functional and Logic Programming - 11th International Sympos...

引用

11th international symposium onfunctional and logic programming, flops 2012

ISBN: (纸本)9783642298219

the proceedings contain 22 papers. the topics discussed include: programming with Boolean satisfaction;automated verification of higher-order functional programs;dependently-typed programming in GHC;call-by-value solvability, revisited;compiling a functional logic language: the basic scheme;classical call-by-need sequent calculi: the unity of semantic artifacts;normal form bisimulations for delimited-control operators;declarative debugging of wrong and missing answers for SQL views;improving the performance of FD constraint solving in a CFLP system;a general implementation framework for tabled CLP;correct looping arrows from cyclic terms: traced categorical interpretation in Haskell;mutual exclusion by interpolation;parallel computation skeletons with premature termination property;and calculational developments of new parallel algorithms for size-constrained maximum-sum segment problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Lambda Calculus for Godel-Dummett logic Capturing Waitfreedom 12

A Lambda Calculus for Godel-Dummett Logic Capturing Waitfree...

引用

11th international symposium on Functional and logic programming (flops)

作者： Hirai, Yoichi Univ Tokyo Tokyo Japan

ISBN: (纸本)9783642298226

We propose a typed lambda calculus based on Avron's hypersequent calculus for Godel-Dummett logic. this calculus turns out to model waitfree computation. Besides strong normalization and non-abortfullness, we give soundness and completeness of the calculus against the typed version of waitfree protocols. the calculus is not only proof theoretically interesting, but also valuable as a basis for distributed programming languages.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Mutual Exclusion by Interpolation 12

Mutual Exclusion by Interpolation

引用

11th international symposium on Functional and logic programming (flops)

作者： Kriener, Jael King, Andy Univ Kent Canterbury CT2 7NF Kent England

ISBN: (纸本)9783642298226

the question of what constraints must hold for a predicate to behave as a ( partial) function, is key to understanding the behaviour of a logic program. It has been shown how this question can be answered by combining backward analysis, a form of analysis that propagates determinacy requirements against the control flow, with a component for deriving so-called mutual exclusion conditions. the latter infers conditions sufficient to ensure that if one clause yields an answer then another cannot. this paper addresses the challenge of how to compute these conditions by showing that this problem can be reformulated as that of vertex enumeration. Whilst directly applicable in logic programming, the method might well also find application in reasoning about type classes.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Coinductive Constraint logic programming 12

Coinductive Constraint Logic Programming

引用

11th international symposium on Functional and logic programming (flops)

作者： Saeedloei, Neda Gupta, Gopal INRIA Paris Rocquencourt Paris France Univ Texas Dallas Richardson TX 75083 USA

ISBN: (纸本)9783642298226

Constraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (rational) infinite objects and reasoning about their properties. Coinductive logic programming does not include constraints while CLP's declarative semantics is given in terms of a least fixed-point (i.e., it is inductive) and cannot directly support reasoning about (rational) infinite objects and their properties. In this paper we combine constraint logic programming and coinduction to obtain co-constraint logic programming (co-CLP for brevity). We present the declarative semantics of co-CLP in terms of a greatest fixed-point and its operational semantics based on the coinductive hypothesis rule. We prove the equivalence of these two semantics for programs with rational terms.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Real-Time Persistent Queues and Deques with logic Variables (Declarative Pearl) 12

Real-Time Persistent Queues and Deques with Logic Variables ...

引用

11th international symposium on Functional and logic programming (flops)

作者： Bouma, Gerlof Univ Gothenburg Dept Swedish Spraakbanken Box 200 S-40530 Gothenburg Sweden

ISBN: (纸本)9783642298226

We present a Prolog implementation of real-time persistent queues and double-ended queues. Our implementation is inspired by Okasaki's lazy-functional approach, but relies only on standard Prolog, comprising of the pure subset plus if-then-else constructs to efficiently implement guards and meta-calls for convenience. the resulting data structure is a nice demonstration of the fact that the use of logic variables to hold the outcome of an unfinished computation can sometimes give the same kind of elegant and compact solutions as lazy evaluation.

关键词： Queues deques persistence Prolog logic variables pearl

来源：评论

学校读者我要写书评

暂无评论

the Finite Domain Constraint Solver of SWI-Prolog 12

The Finite Domain Constraint Solver of SWI-Prolog

引用

11th international symposium on Functional and logic programming (flops)

作者： Triska, Markus Vienna Univ Technol Database & Artificial Intelligence Grp Vienna Austria

ISBN: (纸本)9783642298226

We present a new constraint solver over finite domains, freely available as library(clpfd)(1) in SWI-Prolog. Our solver has several unique features, which we describe in this paper: Reasoning over arbitrarily large integers, always terminating propagation, and a domain-specific language that concisely expresses the full semantics of constraint reification. the library is entirely written in Prolog and can be easily ported to other Prolog systems that support attributed variables. the constraint solver is fast enough for teaching and research purposes and is already being used in courses at several universities in France, Germany, Italy, Austria and other countries.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Compiling a Functional logic Language: the Basic Scheme 12

Compiling a Functional Logic Language: <i>The Basic Scheme</...

引用

11th international symposium on Functional and logic programming (flops)

作者： Antoy, Sergio Peters, Arthur Portland State Univ Comp Sci Dept Portland OR 97207 USA

ISBN: (纸本)9783642298226

We present the design of a compiler for a functional logic programming language and discuss the compiler's implementation. the source program is abstracted by a constructor based graph rewriting system obtained from a functional logic program after syntax desugaring, lambda lifting and similar transformations provided by a compiler's front-end. this system is non-deterministic and requires a specialized normalization strategy. the target program consists of 3 procedures that execute graph replacements originating from either rewrite or pull-tab steps. these procedures are deterministic and easy to encode in an ordinary programming language. We describe the generation of the 3 procedures, discuss the correctness of our approach, highlight some key elements of an implementation, and benchmark the performance of a proof-of-concept. Our compilation scheme is elegant and simple enough to be presented in one page.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

A General Implementation Framework for Tabled CLP 12

A General Implementation Framework for Tabled CLP

引用

11th international symposium on Functional and logic programming (flops)

作者： Chico de Guzman, Pablo Carro, Manuel Hermenegildo, Manuel V. Stuckey, Peter IMDEA Software Inst Madrid Spain Univ Politecn Madrid Sch Comp Sci Madrid Spain NICTA Victoria Res Lab Parkville Vic Australia Univ Melbourne Dept Comp & Informat Syst Melbourne Vic Australia

ISBN: (纸本)9783642298226

this paper describes a framework to combine tabling evaluation and constraint logic programming (TCLP). While this combination has been studied previously from a theoretical point of view and some implementations exist, they either suffer from a lack of efficiency, flexibility, or generality, or have inherent limitations with respect to the programs they can execute to completion (either with success or failure). Our framework addresses these issues directly, including the ability to check for answer / call entailment, which allows it to terminate in more cases than other approaches. the proposed framework is experimentally compared with existing solutions in order to provide evidence of the mentioned advantages.

关键词： Constraint logic programming Tabling Implementation Performance

来源：评论

学校读者我要写书评

暂无评论

Improving the Performance of FD Constraint Solving in a CFLP System 12

Improving the Performance of FD Constraint Solving in a CFLP...

引用

11th international symposium on Functional and logic programming (flops)

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

ISBN: (纸本)9783642298226

Constraint Functional logic programming (CFLP) integrates lazy narrowing with constraint solving. It provides a high modeling abstraction, but its solving performance can be penalized by lazy narrowing and solver interface surcharges. As for real-world problems most of the solving time is carried out by solver computations, the system performance can be improved by interfacing state-of-the-art external solvers with proven performance. In this work we depart from the CFLP system TOY(FD), implemented in SICStus Prolog and supporting Finite Domain (FD) constraints by using its underlying Prolog FD solver. We present a scheme describing how to interface an external CP(FD) solver to TOY(FD), and easily adaptable to other Prolog CLP or CFLP systems. We prove the scheme to be generic enough by interfacing Gecode and ILOG solvers, and we analyze the new performance achieved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Functional and logic programming 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Tom Schrijvers Peter thiemann

ISBN: (数字)9783642298226

ISBN: (纸本)9783642298219

this book constitutes the refereed proceedings of the 11th international symposium on Functional and logic programming, flops 2012, held in Kobe, Japan, in May 2012. the 19 research papers and 3 system demonstrations presented in this volume were carefully reviewed and selected from 39 submissions. they deal with declarative programming, including functional programming and logic programming.

关键词： Software Engineering logics and Meanings of Programs programming Languages, Compilers, Interpreters Mathematical logic and Formal Languages Artificial Intelligence programming Techniques

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：