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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

20 篇 会议

馆藏范围

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

日期分布

学科分类号

20 篇 工学
- 20 篇 计算机科学与技术...
- 20 篇 软件工程
- 4 篇 控制科学与工程
- 1 篇 电子科学与技术（可...
- 1 篇 轻工技术与工程
12 篇 理学
- 12 篇 数学
11 篇 管理学
- 10 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

12 篇 computer program...
4 篇 logic programmin...
1 篇 program debuggin...
1 篇 computer program...
1 篇 dynamic programm...

机构

1 篇 washington unive...
1 篇 università di ud...
1 篇 computer science...
1 篇 inria futurs and...
1 篇 department of co...
1 篇 princeton univer...
1 篇 computer science...
1 篇 max-planck-inst....
1 篇 sch. of comp. sc...
1 篇 heriot-watt univ...
1 篇 university of ve...
1 篇 inria rocquencou...
1 篇 school of comput...
1 篇 cnrs département...
1 篇 institut für inf...
1 篇 new mexico state...
1 篇 university of me...
1 篇 dept. of medical...
1 篇 dipartimento di ...
1 篇 università di pa...

作者

1 篇 stump aaron
1 篇 wu dinghao
1 篇 liu yanhong a.
1 篇 stuckey peter j.
1 篇 sato taisuke
1 篇 blanchet bruno
1 篇 pontelli e.
1 篇 hirschowitz tom
1 篇 naish lee
1 篇 banyasad omid
1 篇 zhou neng-fa
1 篇 leroy xavier
1 篇 nanevski aleksan...
1 篇 damiani ferrucci...
1 篇 de la banda mari...
1 篇 gnaedig isabelle
1 篇 rossi g.
1 篇 pope bernard
1 篇 dovier a.
1 篇 wells j.b.

语言

20 篇 英文

检索条件"任意字段=Fifth ACM SIGPLAN Conference on Principle and Practice of Declarative Programming"

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

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

详细简洁

排序：

Proceedings of the fifth acm sigplan conference on principle and practice of declarative programming

Proceedings of the Fifth ACM SIGPLAN Conference on Principle...

引用

fifth acm sigplan conference on principle and practice of declarative programming

ISBN: (纸本)1581137052

The proceedings contains 26 papers from the fifth acm sigplan conference on principle and practice of declarative programming. The topics discussed include: a functional correspondence between evaluators and abstract machines;conditional narrowing without conditions;finding all minimal unsatisfiable subsets;formally deriving an STG machine;and refining weakly outermost-needed rewriting and narrowing.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the acm sigplan conference on principles and practice of declarative programming: Preface

Proceedings of the ACM SIGPLAN Conference on Principles and ...

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Miller, Dale INRIA Futurs and Ecole Polytechnique PPDP Program Committee France

No abstract available

ISBN: (纸本)1581137052

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic Verification of Cryptographic Protocols: A Logic programming Approach 03

Automatic Verification of Cryptographic Protocols: A Logic P...

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Blanchet, Bruno CNRS Département d'Informatique Écl. Norm. Supérieure Paris Max-Planck-Inst. für Informatik Saarbrücken

ISBN: (纸本)1581137052

We present a technique for cryptographic protocol verification, based on an intermediate representation of the protocol by a set of Horn clauses (a logic program). This technique makes it possible to verify security properties of the protocols, such as secrecy and authenticity, in a fully automatic way. Furthermore, the obtained security proofs are valid for an unbounded number of sessions of the protocol.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Compilation of Extended Recursion in Call-by-Value Functional Languages 03

Compilation of Extended Recursion in Call-by-Value Functiona...

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Hirschowitz, Tom Leroy, Xavier Wells, J.B. INRIA Rocquencourt France Heriot-Watt University United Kingdom

ISBN: (纸本)1581137052

This paper formalizes and proves correct a compilation scheme for mutually-recursive definitions in call-by-value functional languages. This scheme supports a wider range of recursive definitions than standard call-by-value recursive definitions. We formalize our technique as a translation scheme to a lambda-calculus featuring in-place update of memory blocks, and prove the translation to be faithful.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Foundational Proof Checkers with Small Witnesses 03

Foundational Proof Checkers with Small Witnesses

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Wu, Dinghao Appel, Andrew W. Stump, Aaron Princeton University United States Washington University St. Louis United States

ISBN: (纸本)1581137052

Proof checkers for proof-carrying code (and similar systems) can suffer from two problems: huge proof witnesses and untrustworthy proof rules. No previous design has addressed both of these problems simultaneously. We show the theory, design, and implementation of a proof-checker that permits small proof witnesses and machine-checkable proofs of the soundness of the system.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Practical aspects of declarative Debugging in Haskell 98 03

Practical aspects of Declarative Debugging in Haskell 98

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Pope, Bernard Naish, Lee University of Melbourne Parkville Australia

ISBN: (纸本)1581137052

Non-strict purely functional languages pose many challenges to the designers of debugging tools. declarative debugging has long been considered a suitable candidate for the task due to its abstraction over the evaluation order of the program, although the provision of practical implementations has been lagging. In this paper we discuss the solutions used in our declarative debugger for Haskell to tackle the problems of printing values, memory usage and I/O. The debugger is based on program transformation, although much leverage is gained by interfacing with the runtime environment of the language implementation through a foreign function interface.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Integrating Finite Domain Constraints and CLP with Sets

Integrating Finite Domain Constraints and CLP with Sets

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Dal Palù, A. Dovier, A. Pontelli, E. Rossi, G. Università di Udine Dip. di Mat. New Mexico State University Dept. Computer Science Università di Parma Dip. di Matematica

ISBN: (纸本)1581137052

In this paper we propose a semantically well-founded combination of the constraint solvers used in the constraint programming languages CLP (SET) and CLP(FD). This work demonstrates that it is possible to provide efficient executions (through CLP (FD) solvers) while maintaining the expressive power and flexibility of the CLP(SET) language. We develop a combined constraint solver and we show how static analysis can help in organizing the distribution of constraints to the two constraint solvers.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

On Translating Geometric Solids to Functional Expressions 03

On Translating Geometric Solids to Functional Expressions

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Banyasad, Omid Cox, Philip T. Faculty of Computer Science Dalhousie University 6050 University Avenue Halifax NS Canada

ISBN: (纸本)1581137052

Language for Structured Design (LSD) is a high level, visual, logic programming language for design of structured objects. LSD combines the design and programming activities in a homogeneous programming/design environment by extending Lograph, a visual logic programming language, with the notion of solids and operations on them. At the back-end, however, a solid modeling kernel for maintaining low level description of solids and operations is required. In this paper, we report on our progress towards employing PLaSM, a functional programming language for solid modeling, as the solid modeling kernel of LSD. This is achieved through the use of a translator engine which transforms the high level object description produced by LSD programs to PLaSM programs.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Simplification and Termination of Strategies in Rule-Based Languages 03

Simplification and Termination of Strategies in Rule-Based L...

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Fissore, Olivier Gnaedig, Isabelle Kirchner, Hélène LORIA-INRIA LORIA-CNRS B.P. 239 F-54506 Vandoeuvre-les-Nancy Cedex France

ISBN: (纸本)1581137052

In rule-based languages, control of rule application can be expressed thanks to strategy constructors. The paper addresses termination of such strategy-guided evaluation. To fix ideas, we use the ELAN strategy language. We first give a sufficient criterion for ELAN-like strategies to terminate, only lying on rewrite rules involved in the strategy. We then give a simplification process of strategies, itself described by rewriting, to empower the previous criterion. This simplification can also make proofs of other program properties easier.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Term Rewriting with Variable Binding: An Initial Algebra Approach

Term Rewriting with Variable Binding: An Initial Algebra App...

引用

fifth acm sigplan conference on principle and practice of declarative programming

作者： Hamana, Makoto Department of Computer Science Gunma University Japan

ISBN: (纸本)1581137052

We present an extension of first-order term rewriting systems, which involves variable binding in the term language. We develop the systems called binding term rewriting systems (BTRSs) in a stepwise manner;firstly we present the term language, then formulate equational logic, and finally define rewrite systems by two styles: rewrite logic and pattern matching styles. The novelty of this development is that we follow an initial algebra approach in an extended notion of σ-algebras in various functor categories. These are based on Fiore-Plotkin-Turi's presheaf semantics of variable binding and Lüth-Ghani's monadic semantics of term rewriting systems. We characterise the terms, equational logic and rewrite systems for BTRSs are initial algebras in suitable categories. Finally, we discuss our design choice of BTRSs from a semantic perspective.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：