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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 种 纸本馆藏

日期分布

学科分类号

5 篇 理学
- 5 篇 数学
5 篇 工学
- 5 篇 计算机科学与技术...
- 4 篇 软件工程
- 1 篇 电气工程
- 1 篇 信息与通信工程

主题

2 篇 logic programmin...
1 篇 interpreter gene...
1 篇 partial evaluati...
1 篇 refocusing
1 篇 modular sos
1 篇 model checking
1 篇 structural opera...
1 篇 specialization
1 篇 program derivati...

机构

1 篇 portland state u...
1 篇 nagoya inst tech...
1 篇 the university o...
1 篇 univ politecn va...
1 篇 universidad comp...
1 篇 swansea univ dep...
1 篇 nagoya univ grad...

作者

1 篇 nishida naoki
1 篇 vidal german
1 篇 mosses peter d.
1 篇 seki hirohisa
1 篇 jost andy
1 篇 peña ricardo
1 篇 antoy sergio
1 篇 gupta gopal
1 篇 poulsen casper b...

语言

7 篇 英文

检索条件"任意字段=23rd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2013"

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

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

详细简洁

排序：

23rd international symposium on logic-based program synthesis and transformation, lopstr 2013

23rd International Symposium on Logic-Based Program Synthesi...

引用

23rd international symposium on logic-based program synthesis and transformation, lopstr 2013

ISBN: (纸本)9783319141244

The proceedings contain 13 papers. The special focus in this conference is on logic-based program synthesis and transformation. The topics include: Formalization and Execution of Linear Algebra;Information Flow in Object-Oriented Software;A transformational Approach to Resource Analysis with Typed-Norms;Energy Consumption Analysis of programs based on XMOS ISA-Level Models;From Outermost Reduction Semantics to Abstract Machine;Extending Co-logic programs for Branching-Time Model Checking;A New Hybrid Debugging Architecture for Eclipse;Compiling a Functional logic Language and Generating Specialized Interpreters for Modular Structural Operational Semantics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

logic-based program synthesis and transformation 23rd international symposium, lopstr 2013 Madrid, Spain, september 18-19, 2013 revised selected papers 23

Logic-based program synthesis and transformation 23rd intern...

引用

23rd international symposium on logic-based program synthesis and transformation, lopstr 2013

作者： Gupta, Gopal Peña, Ricardo The University of Texas at Dallas RichardsonTX United States Universidad Complutense de Madrid Madrid Spain

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 23rd international symposium on Principles and Practice of Declarative programming, PPDP 2021, co-located with lopstr 2021 - 31st international symposium on logic-based program synthesis and transformation

Proceedings of the 23rd International Symposium on Principle...

引用

23rd international symposium on Principles and Practice of Declarative programming, PPDP 2021, co-located with the 31st international symposium on logic-based program synthesis and transformation, lopstr 2021

ISBN: (纸本)9781450386890

The proceedings contain 21 papers. The topics discussed include: programming languages techniques for controlling generalization errors in adaptive data analysis;the computational structure of programs and the universe;reflecting stacked continuations in a fine-grained direct-style reduction theory;a derived reasonable abstract machine for strong call by value;canonical proof-objects for coinductive programming: infinets with infinitely many cuts;confluence in non-left-linear untyped higher-order rewrite theories;static analysis of pattern-free properties,;a superposition-based calculus for diagrammatic reasoning;and free objects in constraint-logic object-oriented programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compiling a Functional logic Language: The Fair Scheme 1

引用

23rd international symposium on logic-based program synthesis and transformation (lopstr)

作者： Antoy, Sergio Jost, Andy Portland State Univ Dept Comp Sci Portland OR 97207 USA

ISBN: (数字)9783319141251

ISBN: (纸本)9783319141251;9783319141244

We present a compilation scheme for a functional logic programming language. The input program to our compiler is a constructor-based graph rewriting system in a non-confluent, but well-behaved class. This input is an intermediate representation of a functional logic program in a language such as Curry or TOY. The output program from our compiler consists of three procedures that make recursive calls and execute both rewrite and pull-tab steps. This output is an intermediate representation that is easy to encode in any number of programming languages. We formally and tersely define the compilation scheme from input to output programs. This compilation scheme is the only one to date that implements a deterministic strategy for non-deterministic computations with a proof of optimality and correctness.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Finite Representation of the Narrowing Space 1

引用

23rd international symposium on logic-based program synthesis and transformation (lopstr)

作者： Nishida, Naoki Vidal, German Nagoya Univ Grad Sch Informat Sci Chikusa Ku Nagoya Aichi 4648603 Japan Univ Politecn Valencia DSIC MiST E-46022 Valencia Spain

ISBN: (数字)9783319141251

ISBN: (纸本)9783319141251;9783319141244

Narrowing basically extends rewriting by allowing free variables in terms and by replacing matching with unification. As a consequence, the search space of narrowing becomes usually infinite, as in logic programming. In this paper, we introduce the use of some operators that allow one to always produce a finite data structure that still represents all the narrowing derivations. Furthermore, we extract from this data structure a novel, compact equational representation of the (possibly infinite) answers computed by narrowing for a given initial term. Both the finite data structure and the equational representation of the computed answers might be useful in a number of areas, like program comprehension, static analysis, program transformation, etc.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Extending Co-logic programs for Branching-Time Model Checking 1

引用

23rd international symposium on logic-based program synthesis and transformation (lopstr)

作者： Seki, Hirohisa Nagoya Inst Technol Dept Comp Sci Showa Ku Nagoya Aichi 4668555 Japan

ISBN: (数字)9783319141251

ISBN: (纸本)9783319141251;9783319141244

Co-logic programming is a programming language allowing each predicate to be annotated as either inductive or coinductive. Assuming the stratification restriction, a condition on predicate dependency in co-logic programs (co-LPs), a top-down procedural semantics (co-SLD derivation) as well as an alternating fixpoint semantics has been given. In this paper, we present some extensions of co-LPs, especially focusing on the relationship with the existing alternating tree automata approaches to branching-time model checking. We first consider the local stratification restriction to allow a more general class of co-LPs, so that we can encode the CTL satisfaction relation as a co-LP, which is a direct encoding of the standard alternating automata by Kupferman et al. Next, we consider non-stratified co-LPs based on the Horn mu-calculus. We give a proof procedure, co-SLD derivation with the parity acceptance condition, for non-stratified co-LPs, and show that it is sound and complete for a class of non-stratified co-LPs. Its application to a goal-directed top-down proof procedure for normal logic programs is also discussed.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Generating Specialized Interpreters for Modular Structural Operational Semantics 1

引用

23rd international symposium on logic-based program synthesis and transformation (lopstr)

作者： Poulsen, Casper Bach Mosses, Peter D. Swansea Univ Dept Comp Sci Swansea SA2 8PP W Glam Wales

ISBN: (数字)9783319141251

ISBN: (纸本)9783319141251;9783319141244

Modular Structural Operational Semantics (MSOS) is a variant of Structural Operational Semantics (SOS). It allows language constructs to be specified independently, such that no reformulation of existing rules in an MSOS specification is required when a language is extended with new constructs and features. Introducing the Prolog MSOS Tool, we recall how to synthesize executable interpreters from small-step MSOS specifications by compiling MSOS rules into Prolog clauses. Implementing the transitive closure of compiled small-step rules gives an executable interpreter in Prolog. In the worst case, such interpreters traverse each intermediate program term in its full depth, resulting in a significant overhead in each step. We show how to transform small-step MSOS specifications into corresponding big-step specifications via a two-step specialization by internalizing the rules implementing the transitive closure in MSOS and 'refocusing' the small-step rules. Specialized specifications result in generated interpreters with significantly reduced interpretive overhead.

关键词： Interpreter generation Structural operational semantics Modular SOS Specialization Partial evaluation program derivation Refocusing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：