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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

24 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

18 篇 工学
- 17 篇 计算机科学与技术...
- 13 篇 软件工程
- 2 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 电气工程
- 1 篇 控制科学与工程
10 篇 理学
- 10 篇 数学
- 2 篇 物理学

主题

17 篇 semantics
1 篇 internet of thin...
1 篇 software enginee...
1 篇 workflow
1 篇 specifications
1 篇 mathematics, gen...
1 篇 pi-calculus
1 篇 topology
1 篇 visual programmi...
1 篇 algebra
1 篇 logics and meani...
1 篇 multi agent syst...
1 篇 robotics

机构

1 篇 department of co...
1 篇 department of co...
1 篇 computing scienc...
1 篇 department of ma...
1 篇 computer laborat...
1 篇 department of el...
1 篇 colgate universi...
1 篇 programming rese...
1 篇 mit laboratory f...
1 篇 department of co...
1 篇 oxford universit...
1 篇 computer science...
1 篇 department of ma...
1 篇 siemens ag e ste...
1 篇 arizona state un...
1 篇 department of ma...
1 篇 ewh-rheinland-pf...
1 篇 dept. of compute...
1 篇 yale university ...
1 篇 computer science...

作者

1 篇 zamfir maria
1 篇 kent robert e.
1 篇 reed g.m.
1 篇 lespérance yves
1 篇 révész györgy e.
1 篇 shapiro steven
1 篇 bekki daisuke
1 篇 brookes stephen ...
1 篇 bradley laurette
1 篇 reed joylyn
1 篇 mulry philip s.
1 篇 riecke jon g.
1 篇 watt david a.
1 篇 manes ernie
1 篇 mislove michael
1 篇 bruce kim b.
1 篇 jackel manfred
1 篇 pleban uwe f.
1 篇 gunter carl
1 篇 lee peter

语言

25 篇 英文

检索条件"任意字段=3rd Workshop on the Mathematical Foundations of Programming Language Semantics, 1987"

共 25 条记录，以下是11-20 订阅

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

详细简洁

排序：

semantics of block structured languages with pointers 3rd

Semantics of block structured languages with pointers

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Wagner, Eric G. Mathematical Sciences Department IBM T.J. Watson Research Center Yorktown HeightsNY10598 United States

ISBN: (纸本)9783540190202

This paper presents an algebraic and categorical approach to the mathematical modeling of imperative programming languages. In particular we model languages with block structure, records and variants, user definable recursive types, and pointers, etc., and with "control constructs" such as primitive recursion (generalized to recursive types), while-do, if-then-else, and assignment. In our earlier papers on this subject ([4], [5], [6]) we showed how data types and operations can be defined in an algebraic framework. In this paper we present a more mathematically sophisticated version of that framework, and we show how it can be used to provide a new approach to languages that have block structure together with objects, such as pointers, which are dynamically declared and may persist outside the block in which they are declared. The main new mathematical concept, and the key to the development, is the concept of an EDHT-category which is an extension of the DHT-symmetric categories introduced by Hoehnke [13] as a categorical framework for partial algebras. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

The formal description of data types using sketches 3rd

The formal description of data types using sketches

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Wells, Charles Barr, Michael Department of Mathematics and Statistics Case Western Reserve University ClevelandOH44106 United States Department of Mathematics and Statistics McGill University 805 Sherbrooke St. West MontréalQuébecH3A 2K6 Canada

ISBN: (纸本)9783540190202

This paper is an exposition of the basic ideas of the mathematical theory of sketches and a detailed description of some of the ways in which this theory can be used in theoretical computer science to specify datatypes. In particular, this theory provides a convenient way of introducing datatypes which have variants, for example in case of errors or nil pointers. The semantics is a generalization of initial algebra semantics which in some cases allows initial algebras depending on a parameter such as a bound for overflow. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

A treatment of languages with stages of evaluation 3rd

A treatment of languages with stages of evaluation

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Bradley, Laurette Dept. of Computer Science and Engineering C-014 University of California San Diego La JollaCA92093 United States

ISBN: (纸本)9783540190202

The notion of languages that inherently have multiple stages of evaluation is introduced. Typically, evaluation is done in stages so that evaluation in some one stage is able to be done very efficiently, even at the expense of prior stages of evaluation. A key novel feature in such languages is that constructs may have appropriate times of meaning as well as appropriate meanings. While it is possible to give semantics to such languages without regard to times of meaning, it is shown that certain semantic related concepts, such as translation, cannot be adequately described without reference to times of evaluation. The major contribution provided here to the study of complex languages with multiple stages of evaluation is the development of a method of describing such languages so that semantics reflecting various times of evaluation can be derived from the descriptions. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

The metric closure powerspace construction 3rd

The metric closure powerspace construction

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Kent, Robert E. Department of Electrical Engineering and Computer Science University of Illinois at Chicago ChicagoIL60680 United States

ISBN: (纸本)9783540190202

In this paper we develop a natural powerobject construction in the context of enriched categories, a context which generalizes the traditional order-theoretic and metric space contexts. This powerobject construction is a subobject transformer involving the dialectical flow of closed subobjects of enriched categories. It is defined via factorization of a comprehension schema over metrical predicates, followed by the fibrational inverse image of metrical predicates along character, the left adjoint in the comprehension schema. A fundamental continuity property of this metrical powerobject construction vis-a-vis greatest fixpoints is established by showing that it preserves the limit of any Cauchy ωop-diagram. Using this powerobject construction we unify two well-known fixpoint semantics for concurrent interacting processes. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

Path semantics 3rd

Path semantics

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Bloss, Adrienne Hudak, Paul Yale University New HavenCT06520 United States

ISBN: (纸本)9783540190202

Knowledge of order of evaluation of expressions is useful for compile-time optimizations for lazy sequential functional programs. We present path semantics, a non-standard semantics that describes order of evaluation for a first-order functional language with lazy evaluation. We also provide an effective abstraction of path semantics that provides compile-time information. We show how path semantics may be used in strictness analysis, process scheduling in parallel systems, and optimized self-modifying thunks. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

Rule-based semantics for an extended lambda-calculus 3rd

Rule-based semantics for an extended lambda-calculus

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Révész, György E. IBM T. J. Watson Research Center Yorktown HeightsNY United States

ISBN: (纸本)9783540190202

Many implementation techniques proposed for functional languages in the literature are based on lambda-calculus and the theory of combinators [5, 12, 14]. The main advantage of functional languages over the more conventional programming languages is their lack of side-effects which makes their semantics much simpler [2]. This paper presents a λ-calculus dialect with list-handling extensions that can be used for defining an operational semantics for functional programs. This semantics is based on a set of elementary α-rules and β-rules which collectively implement the substitution operation without explicitly using it [10]. Two extra reduction rules, called γ-rules, have been added to the system for list manipulations [11]. Combining λ-calculus with list-handling capabilities makes an efficient vectorization of λ-calculus possible. This way we obtain a very elegant treatment of mutual recursion in our system. The reduction rules described in this paper represent, in fact, an operational semantics for our extended λ-notation. An interpreter program for this extended λ-calculus has been developed by a direct implementation of the reduction rules which makes the correctness proof of the interpreter very easy. The notion of controlled reduction is introduced here to guarantee the existence of a normal form for λ-expressions representing recursively defined functions using the Y combinator. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

dI-domains as a model of polymorphism 3rd

dI-domains as a model of polymorphism

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Coquand, Thierry Gunter, Carl Winskel, Glynn Computer Laboratory University of Cambridge CambridgeCB2 3QG United Kingdom

ISBN: (纸本)9783540190202

In this paper we investigate a model construction recently described by Jean Yves Girard. This model differs from the models of McCracken, Scott, etc. in that the types are interpreted (quite pleasingly) as domains rather than closures or finitary projections on a universal domain. Our objective in this paper is two-fold. First, we would like to generalize Girard's construction to a larger category called dI-domains which was introduced by Berry [2]. The dI-domains possess many of the virtues of the domains used by Girard. Moreover, the dI-domains are closed under the separated sum and lifting operators from denotational semantics and this is not true of the domains of Girard. We intend to demonstrate that our generalized construction can be used to do denotational semantics in the ordinary way, but with the added feature of type polymorphism with a "types as domains" interpretation. Our second objective is to show how Girard's construction (and our generalization) can be done abstractly. We also give a representational description of our own construction using the notion of a prime event structure. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

Assertional categories 3rd

Assertional categories

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Manes, Ernie Department of Mathematics and Statistics Lederle Research Center Tower University of Massachusetts AmherstMA01003 United States

ISBN: (纸本)9783540190202

Assertional categories provide a general algebraic framework for the denotation of programs. While the axioms deal exclusively with the abstract structure of coproducts, it is possible to express Boolean structure, loop-free constructs and predicate transformers and to deduce basic properties associated with propositional dynamic logic. At the foundational level, new "quarks" to build the atomic constructions of programs are espoused, leading to a new categorical duality principle for predicate transformers (based on a semilattice completion by ideals) and to the "grand unification principle" that "composition determines semantics". The first-order theory of assertional categories is more general than dynamic logic in that nondeterminism may include repetition count, that is, f + f need not be f. On the other hand, an adaptation of a theorem of Kozen shows that, at least for iteration-free sentences about predicate transformers, semantics is standard. Several algebraic characterizations of Dijkstra's definition of determinism are offered and one leads to a technique to reduce loop-free expressions to guarded commands. Axioms for iteration include a "uniformity principle" that "related programs have related iterates" and the Segerburg induction axiom follows. © 1988, Springer-Verlag.

关键词： semantics

来源：评论

学校读者我要写书评

暂无评论

Metric spaces as models for real-time concurrency 3rd

Metric spaces as models for real-time concurrency

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Reed, G.M. Roscoe, A.W. Oxford University Computing Laboratory 7-11 Keble Road OxfordOX1 3QD United Kingdom

ISBN: (纸本)9783540190202

We propose a denotational model for real time concurrent systems, based on the failures model for CSP. The fixed point theory is based on the Banach fixed point theorem for complete metric spaces, since the introduction of time as a measure makes all recursive operators naturally contractive. This frees us from many of the constraints imposed by partial orders on the treatment of nondeterminism and divergence. © 1988, Springer-Verlag.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Initial algebra semantics and concurrency 3rd

Initial algebra semantics and concurrency

引用

3rd workshop on the mathematical foundations of programming language semantics, 1987

作者： Zamfir, Maria Computer Science Department KSU ManhattanKS66506 United States

ISBN: (纸本)9783540190202

The purpose of this paper is to show that initial algebra semantics has an immediate and useful application in the area of communicating computing systems. The major technical feature is a category of continuous many-sorted algebras ca led parallel-nondeterministic algebras. In this setting parallel and nondeterministic behaviors of communicating computing systems can be rigorously formulated as sequences of rewritings on abstract objects called parallel-nondeterministic terms or diamonds. It is shown that diamonds are free in the category of continuous parallel-nondeterministic algebras. (To demonstrate this fact, some results concerning categories of continuous algebras, which can be found in the work of the ADJ group, are presented in a self-contained form.) Nondeterminism and parallelism are modeled explicitly by introducing a choice operator and a parallel operator, respectively. In a companion paper [10] flow nets are introduced to describe parallel and nondeterministic behaviors of computing systems that communicate with each other, just as conventional flowcharts are used to describe sequential computations. In a continuous parallel-nondeterministic algebra a flow net is represented by its unfoldment — the solution of a finite system of recursive equations. © 1988, Springer-Verlag.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共3页 << < 1 2 3 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：