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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

187 篇 会议
7 册 图书
4 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

157 篇 工学
- 147 篇 计算机科学与技术...
- 95 篇 软件工程
- 12 篇 电气工程
- 8 篇 控制科学与工程
- 6 篇 信息与通信工程
- 6 篇 化学工程与技术
- 3 篇 机械工程
- 2 篇 电子科学与技术（可...
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 农业工程
- 1 篇 环境科学与工程（可...
22 篇 理学
- 17 篇 数学
- 3 篇 物理学
- 3 篇 生物学
- 3 篇 系统科学
12 篇 管理学
- 8 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
- 2 篇 工商管理
2 篇 文学
- 2 篇 外国语言文学
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...
1 篇 艺术学
- 1 篇 艺术学理论
- 1 篇 音乐与舞蹈学

主题

41 篇 logic programmin...
22 篇 functional progr...
13 篇 semantics
7 篇 temporal logic
6 篇 computer science
5 篇 automatic contro...
4 篇 computer circuit...
4 篇 model checking
4 篇 software enginee...
4 篇 mathematical log...
4 篇 hardware
4 篇 programming lang...
4 篇 specification la...
4 篇 dynamic programm...
4 篇 computer program...
3 篇 fuzzy logic
3 篇 formal logic
3 篇 logic gates
3 篇 computational mo...
3 篇 real-time system...

机构

2 篇 cinvestav gdl de...
2 篇 departamento de ...
2 篇 univ complutense...
2 篇 carnegie mellon ...
2 篇 univ limerick le...
2 篇 nara inst sci & ...
2 篇 univ tokyo
2 篇 cau kiel inst in...
2 篇 tu dortmund univ...
2 篇 univ london impe...
1 篇 univ augsburg de...
1 篇 telecom bretagne...
1 篇 univ innsbruck i...
1 篇 department of co...
1 篇 univ pisa dipart...
1 篇 tu dortmund univ...
1 篇 univ pisa dept c...
1 篇 department of ma...
1 篇 katholieke univ ...
1 篇 univ southern ca...

作者

4 篇 steffen bernhard
3 篇 kobayashi naoki
2 篇 jain v
2 篇 nishitani h
2 篇 stuckey peter j.
2 篇 vidal g
2 篇 albert e
2 篇 grossman ie
2 篇 imafuku k
2 篇 lano k
2 篇 vidal german
2 篇 chavoya a
2 篇 neubauer johanne...
2 篇 sanchez a
2 篇 harjunkoski i
2 篇 ramakrishnan i.v...
2 篇 naujokat stefan
2 篇 hanus m
2 篇 margaria tiziana
2 篇 antoniou grigori...

语言

194 篇 英文
4 篇 其他

检索条件"任意字段=7th International Symposium on Functional and Logic Programming"

共 198 条记录，以下是121-130 订阅

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

详细简洁

排序：

Enhancing system validation with behavioural types 7

Enhancing system validation with behavioural types

引用

7th IEEE international symposium on High Assurance Systems Engineering

作者： Gossens, S Univ Erlangen Nurnberg Inst Comp Sci Lehrstuhl Comp Architecture 3 D-91056 Erlangen Germany

ISBN: (纸本)0769517692

the behaviour of systems is determined by their implementation in some form of source code. While behaviour itself is complex and its detailed semantics are hard to describe by means of lower level than a programming or specification language, the structure of dynamic input/output behaviour is limited by the system logic and fixed during operation in most cases. Certain aspects of system behavior can be captured by regular expressions that define the possible input/output behaviors of the system. A more refilled kind of regular expression can be constructed that does not only represent I/O interleaving but also the location and type of every particular I/O event. this article describes the generation of such expressions and shows how they, can be used to aid classic verification by, testing, as well as in a criterion to assess the quality of given test case sets. Additionally, a method is sketched to falsify the behavioural identity of systems using the presented approach. Finally, a tool to apply the presented ideas in verification practice on MC68HC705J1A microcontroller programs is overviewed.

关键词： Automata Automatic control Computer architecture Computer science Control systems Dynamic programming Hardware logic programming Specification languages Testing

来源：评论

学校读者我要写书评

暂无评论

Meta-programming with names and necessity 02

Meta-programming with names and necessity

引用

7th international Conference on functional programming

作者： Nanevski, A Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781581134872

Meta-programming languages provide infrastructure to generate and execute object programs at run-time. In a typed setting, they contain a modal type constructor which classifies object code. these code types generally come in two flavors: closed and open. Closed code expressions can be invoked at run-time, but the computations over them are more rigid, and typically produce less efficient residual object programs. Open code provides better inlining and partial evaluation of object programs, but once constructed, expressions of this type cannot in general be evaluated. Recent work in this area has focused on combining the two notions into a sound system. We present a novel way to achieve this. It is based on adding the notion of names from the work on Nominal logic and FreshML to the lambda(square)-calculus of proof terms for the necessity fragment of modal logic S4. the resulting language provides a more fine-grained control over free variables of object programs when compared to the existing languages for meta-programming. In addition, this approach lends itself well to addition of intensional code analysis, i.e. ability of meta programs to inspect and destruct object programs at run-time in a type-safe manner, which we also undertake.

关键词： languages modal lambda-calculus higher-order abstract syntax

来源：评论

学校读者我要写书评

暂无评论

Narrowing failure in functional logic programming 6th

Narrowing failure in functional logic programming

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： López-Fraguas, Francisco Javier Sánchez-Hernández, Jaime Dep. Sistemas Informáticos y Programación Univ. Complutense de Madrid Spain

ISBN: (纸本)3540442332

Negation as failure is an important language feature within the logic programming paradigm. the natural notion generalizing negation as failure in a functional logic setting is that of finite failure of reduction. In previous works we have shown the interest of using such programming construct when writing functional logic programs, and we have given a logical status to failure by means of proof calculi designed to deduce failures from programs. In this paper we address the problem of the operational mechanism for the execution of functional logic programs using failure. Our main contribution is the proposal of a narrowing relation able to deal with failures, which is constructive in the usual sense of the term in the context of negation, that is, narrowing is able to find substitutions for variables even in presence of failures. As main technical results, we prove correctness and completeness of the narrowing relation with respect to the proof-theoretic semantics. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

the head condition and polymorphic recursion 6th

The head condition and polymorphic recursion

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： Smaus, Jan-Georg Institut für Informatik Universität Freiburg Georges-Köhler-Allee 52 Freiburg79110 Germany

ISBN: (纸本)3540442332

In typed logic programming, the head condition states that for each clause defining a predicate p, the arguments of the clause head must have the declared type of p, rather than a proper polymorphic instance. In typed functional programming, polymorphic recursion means that in a recursive definition of a function f, the recursive call to f uses a type which is a proper instance of the declared type of f. We show that both notions are also meaningful in the respectively other paradigm. We observe a symmetry between the head condition and the "monomorphic recursion condition" (meaning absence of polymorphic recursion). We discuss arguments for and against each condition in both paradigms. © Springer-Verlag Berlin Heidelberg 2002.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Coinductive interpreters for process calculi 6th

Coinductive interpreters for process calculi

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： Barbosa, Luís Soares Oliveira, José Nuno Departamento de Informática Universidade do Minho Braga Portugal

ISBN: (纸本)3540442332

this paper suggests functional programming languages with coinductive types as suitable devices for prototyping process calculi. the proposed approach is independent of any particular process calculus and makes explicit the different ingredients present in the design of any such calculi. In particular structural aspects of the underlying behaviour model become clearly separated from the interaction structure which defines the synchronisation discipline. the approach is illustrated by the detailed development in Charity of an interpreter for a family of process languages. © Springer-Verlag Berlin Heidelberg 2002.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

functional logic design patterns 6th

Functional logic design patterns

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： Antoy, Sergio Hanus, Michael Computer Science Department Portland State University P.O. Box 751 PortlandOR97207 United States Institut für Informatik Christian-Albrechts-Universität Kiel Olshausenstr. 40 KielD-24098 Germany

ISBN: (纸本)3540442332

We introduce a handful of software design patterns for functional logic languages. Following usual approaches, for each pattern we propose a name and we describe its intent, applicability, structure, consequences, etc. Our patterns deal with data type construction, identifier declarations, mappings, search, non-determinism and other fundamental aspects of the design and implementation of programs. We present some problems and we show fragments of programs that solve these problems using our patterns. the programming language of our examples is Curry. the complete programs are available on-line. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

the well-founded semantics in normal logic programs with uncertainty 6th

The well-founded semantics in normal logic programs with unc...

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： Loyer, Yann Straccia, Umberto I-56124 Italy

ISBN: (纸本)3540442332

Many frameworks of logic programming have been proposed to manage uncertain information in deductive databases and expert systems. Roughly, on the basis of how uncertainty is associated to facts and the rules in a program, they can be classified into implication-based (IB) and annotation-based (AB). However, one fundamental issue that remains unaddressed in the IB approach is the representation and the manipulation of the non-monotonic mode of negation, an important feature for real applications. Our focus in this paper is to introduce nonmonotonic negation in the parametric IB framework, a unifying umbrella for IB frameworks. the semantical approach that we will adopt is based on the well-founded semantics, one of the most widely studied and used semantics of (classical) logic programs with negation. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Intelligent databases

来源：评论

学校读者我要写书评

暂无评论

Structural abstraction and application in logic programming 6th

Structural abstraction and application in logic programming

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： Porto, António Departamento de Informática Universidade Nova de Lisboa Portugal

ISBN: (纸本)3540442332

this paper explores a seeminglyv ery simple idea—an operation for extending a term with extra (start or end) arguments to yield a new term. this allows the definition a varietyof structural operators that provide the power of functional composition and higher-order features on top of the non-directional and non-deterministic (relational) behavior of the underlying logic programming setting. Syntax alone is taken to be meaningless, semantics being associated to syntax in context. Multiple semantic views of each term are therefore possible, in different contexts. One such semantic view is structural, wherebya ny term is taken as an implicit abstraction of another term over some of its subterms. the standard operational semantics is extended with a rewrite step prior to each goal invocation, that appeals to a functional rewrite semantics to interpret certain terms as applications of implicit inner structural abstractions to inner arguments. the approach is first described through meta-level functional definitions, and then an implementation is shown through a collection of standard Prolog predicates. the powerful gain in expressiveness is thus achieved without anye xtension of the underlying machinery, much in the spirit of an old claim by D. H. Warren [5]. the scheme was motivated byt he needs of a large real-world application [4] where it is now in use. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

To the gates of HAL: A HAL tutorial 6th

To the gates of HAL: A HAL tutorial

引用

6th Fuji international symposium on functional and logic programming, FLOPS 2002

作者： de la Banda, María García Demoen, Bart Marriott, Kim Stuckey, Peter J. School of Computer Science and Software Engineering Monash University Australia Dept. of Computer Science K.U. Leuven Belgium Dept. of Computer Science and Software Engineering University of Melbourne Australia

ISBN: (纸本)3540442332

Experience using constraint programming to solve real-life problems has shown that finding an efficient solution to the problem often requires experimentation with different constraint solvers or even building a problem-specific constraint solver. HAL is a new constraint logic programming language expressly designed to facilitate this process. It provides semi-optional type, mode and determinism declarations. these allow natural constraint specification by means of type overloading, better compile-time error checking and generation of more efficient run-time code. Importantly, it provides type classes which can be used to specify solver interfaces, allowing the constraint programmer to support modelling of a constraint problem independent of a particular solver, leading to easy "plug and play" experimentation with different solvers. Other interesting features include mutable global variables for implementing a constraint store, and dynamic scheduling and Constraint Handling Rules (CHRs) for combining, extending and writing new constraint solvers. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Enhancing system validation with behavioural types

Enhancing system validation with behavioural types

引用

IEEE international Symposim on High Assurance Systems Engineering

作者： S. Gossens Institute for Computer Science Lehrstuhl 3 (Computer Architecture) University Erlangen-Nuünberg Erlangen Germany

the behaviour of systems is determined by their implementation in some form of source code. While behaviour itself is complex and its detailed semantics are hard to describe by means of lower level than a programming or specification language, the structure of dynamic input/output behaviour is limited by the system logic and fixed during operation in most cases. Certain aspects of system behavior can be captured by regular expressions that define the possible input/output behaviors of the system. A more refined kind of regular expression can be constructed that does not only represent I/O interleaving but also the location and type of every particular I/O event. this article describes the generation of such expressions and shows how they can be used to aid classic verification by testing, as well as in a criterion to assess the quality of given test case sets. Additionally, a method is sketched to falsify the behavioural identity of systems using the presented approach. Finally, a tool to apply the presented ideas in verification practice on MC68HC705J1A microcontroller programs is overviewed.

关键词： Testing Hardware Control systems Dynamic programming logic programming Automata Automatic control Computer science Computer architecture Specification languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：