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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

25 篇 会议
8 册 图书
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

19 篇 工学
- 19 篇 计算机科学与技术...
- 13 篇 软件工程
- 1 篇 材料科学与工程（可...
- 1 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 建筑学
10 篇 理学
- 10 篇 数学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
3 篇 管理学
- 3 篇 图书情报与档案管...

主题

6 篇 logic programmin...
5 篇 mathematical log...
5 篇 programming tech...
3 篇 theory of comput...
3 篇 software enginee...
3 篇 logics and meani...
2 篇 software enginee...
2 篇 formal logic
2 篇 mathematical log...
2 篇 semantics
2 篇 programming lang...
2 篇 artificial intel...
2 篇 functional progr...
1 篇 object oriented ...
1 篇 computer circuit...
1 篇 libraries
1 篇 foundations
1 篇 cognition
1 篇 concurrent compu...
1 篇 programming

机构

1 篇 portland state u...
1 篇 department of in...
1 篇 laboratory for t...
1 篇 ladseb-cnr corso...
1 篇 sri internationa...
1 篇 department of co...
1 篇 gec hirst resear...
1 篇 department of co...
1 篇 syracuse univ na...
1 篇 department of ar...
1 篇 university of ca...
1 篇 institute of com...
1 篇 chalmers univers...
1 篇 microsoft resear...
1 篇 univ birmingham ...
1 篇 center for the s...
1 篇 sri internationa...
1 篇 laboratoire d'in...
1 篇 laboratory for f...
1 篇 computer science...

作者

2 篇 longley john
2 篇 goguen joseph a.
1 篇 meseguer josé
1 篇 guarino nicola
1 篇 cédric fournet
1 篇 andrei sabelfeld
1 篇 miglioli p.
1 篇 kumar anil
1 篇 staples john
1 篇 nielson f
1 篇 burn gl
1 篇 sannella donald
1 篇 ornaghi m.
1 篇 ferrand g.
1 篇 karthikeyan bhar...
1 篇 abramsky s
1 篇 antoy s
1 篇 tessier a.
1 篇 jesper bengtson
1 篇 tarlecki andrzej

语言

36 篇 英文

检索条件"任意字段=Workshop on Foundations of Logic and Functional Programming, 1986"

共 36 条记录，以下是21-30 订阅

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

详细简洁

排序：

Extensions and foundations of object-oriented programming 86

Extensions and foundations of object-oriented programming

引用

1986 SIGPLAN workshop on Object-Oriented programming, OOPWORK 1986

作者： Goguen, Joseph A. Meseguer, José SRI International Menlo ParkCA94025 United States Center for the Study of Language and Information Stanford University 94305 United States

ISBN: (纸本)0897912055

This paper has three major objectives: (i) to provide several new features for object-oriented programming (OOP);(ii) to provide a rigorous logical semantics for OOP;and (in) to unify OOP with functional programming. FOOPS is a clean new programming language that embodies our approach to these objectives. Following a broad definition of "logical programming, " our main techniques are described: (1) subsorts (from order-sorted algebra) for multiple inheritance;(2) a distinction between "adt" (for abstract data type) modules and "object" modules;and (3) "reflection, " in the sense of providing a built-in data type for programs in a functional sublanguage. Among the features of FOOPS that are new to OOP are: (4) user-definable abstract data types;(5) generic modules;(6) strong but flexible typing, with overloaded mixfix operations;(7) integration of coding with specification;and (8) an operational semantics (based on term-rewriting) that should be very efficient on suitable parallel machines. In addition, (9) a logical basis is provided in "reflective" logic. Some examples of FOOPS are given. © 1986 Association for Computing Machinery Inc. All rights reserved.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 1986 SIGPLAN workshop on Object-Oriented programming, OOPWORK 1986

Proceedings of the 1986 SIGPLAN Workshop on Object-Oriented ...

引用

1986 SIGPLAN workshop on Object-Oriented programming, OOPWORK 1986

ISBN: (纸本)0897912055

The proceedings contain 19 papers. The topics discussed include: an object-oriented framework for graphical programming;compilation into actors;exceptions in object-oriented languages;a generalized object model;objects in concurrent logic programming languages;concurrent programming in orient84ik: an object-oriented knowledge representation language;enhancement for multiple-inheritance;an overview of actor languages;a comparison of the object-oriented and process paradigms;maintaining consistency in a database with changing types;extensions and foundations of object-oriented programming;an algebraic model of subtypes in object-oriented languages (draft);basic concepts in object oriented programming;a mechanism for specifying the structure of large, layered, object-oriented programs;block structure and object oriented languages;and classification in object-oriented systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

workshop on Category Theory and Computer programming, 1985

Workshop on Category Theory and Computer Programming, 1985

引用

workshop on Category Theory and Computer programming, 1985

ISBN: (纸本)9783540171621

The proceedings contain 28 papers. The special focus in this conference is on Category Theory and Computer programming. The topics include: A categorical view of weakest liberal preconditions;functor-category semantics of programming languages and logics;finite approximation of spaces: Extended abstract;Categories of partial morphisms and the λP-calculus: Extended abstract;a note on distributive laws and power domains;category theory and models for parallel computation;categorical models of process cooperation;galois connections and computer science applications;a study in the foundations of programming methodology: Specifications, institutions, charters and parchments;elements of categorical reasoning: Products and coproducts and some other (co-)limits;bits and pieces of the theory of institutions;Extended ML: An institution-independent framework for formal program development;behavioural program specification;key extensions of abstract data types, final algebras, and database semantics;theories as categories;internal completeness of categories of domains;formalising the network and hierarchical data models — an application of categorical logic;a categorical unification algorithm;computing with categories;functors and natural transformations;adjunctions;cartesian closure — Higher types in categories;algebra categorically;category theory and logic;categories, data types, and imperative languages;category theory and programming language semantics: An overview.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Formalising the network and hierarchical data models — an application of categorical logic

Formalising the network and hierarchical data models — an a...

引用

workshop on Category Theory and Computer programming, 1985

作者： Cartmell, John Software Sciences Ltd. London and Manchester House Park Street MacclesfieldCheshireSKI1 6SR United Kingdom

ISBN: (纸本)9783540171621

We have noted that data modelling and conceptual modelling have content and performance as their concerns. For the different data models, the Network and the Hierarchic, we have given logics involving the operations which are physically supported according to the data model. The logics are sensitive to performance in a way that classical logic is not. We have now suggested how we might formalise this. Network and Hierarchical databases have the functional inverse or family as their primitive of organisation. To formalise the Network model we have given a general definition of network category which seems to generalise correctly the hierarchical logic of contextual categories. © 1986, Springer-Verlag.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

ARTIFICIAL INTELLIGENCE, logic programming, AND STATISTICS IN MAGNETIC RESONANCE IMAGING AND SPECTROSCOPIC ANALYSIS.

引用

Artificial Intelligence Applications in Chemistry. Developed from a Symposium at the 190th Meeting of the American Chemical Society.

作者： Harner, Teresa J. Levy, George C. Dudewicz, Edward J. Delaglio, Frank Kumar, Anil Syracuse Univ Natl Inst of Health Resource for Multi-Nuclei NMR & Data Processing Syracuse NY USA Syracuse Univ Natl Inst of Health Resource for Multi-Nuclei NMR & Data Processing Syracuse N

ISBN: (纸本)0841209669

logic programming in combination with expert directed statistical analysis makes possible a unique aproach to new expert systems for NMR and other chemical analyses as well as for medical applications of NMR. This approach has been applied to understanding the behavior of T//1, T//2 and **1H density in magnetic resonance imaging (MRI). Also, this technique is used to develop intelligent behavior within NMR1 and NMR2 spectroscopic data reduction systems. Sets of rules generate a solution space which may be statistical, functional or symbolic (non-numerical). Unlike other expert system environments, the statistical foundations which govern many of the 'macroscopic' inferences are included, allowing for modification to the underlying 'implicit' statistical bases at any time.

关键词： NUCLEAR MAGNETIC RESONANCE

来源：评论

学校读者我要写书评

暂无评论

A study in the foundations of programming methodology: Specifications, institutions, charters and parchments

A study in the foundations of programming methodology: Speci...

引用

workshop on Category Theory and Computer programming, 1985

作者： Goguen, Joseph A. Burstall, R.M. SRI International the University of Edinburgh United Kingdom Center for the the Study of Language and Information at Stanford University United States

ISBN: (纸本)9783540171621

The theory of institutions formalizes the intuitive notion of a "logical system." Institutions were introduced (1) to support as much computer science as possible independently of the underlying logical system, (2) to facilitate the transfer of results (and artifacts such as theorem provers) from one logical system to another, and (3) to permit combining a number of different logical systems. In particular, programming-in-the-large (in the style of the Clear specification language) is available for any specification or "logical" programming language based upon a suitable institution. Available features include generic modules, module hierarchies, "data constraints" (for data abstraction), and "multiplex" institutions (for combining multiple logical systems). The basic components of an institution are: a category of signatures (which generally provide symbols for constructing sentences);a set (or category) of Σ-sentences for each signature Σ;a category (or set) of Σ-models for each Σ;and a Σ-satisfaction relation, between Σ-sentences and Σ-models, for each Σ. The intuition of the basic axiom for institutions is that truth (i.e., satisfaction) is invariant under change of notation. This paper enriches institutions with sentence morphisms to model proofs, and uses this to explicate the notion of a logical programming language. To ease constructing institutions, and to clarify various notions, this paper introduces two further concepts. A charter consists of an adjunction, a "base" functor, and a "ground" object;we show that "chartering" is a convenient way to "found" institutions. Parchments provide a notion of sentential syntax, and a simple way to "write" charters and thus get institutions. Parchments capture the insight that the syntax of logic is an initial algebra. Everything is illustrated with the many-sorted equational institution. Parchments also explicate the sense of finitude that is appropriate for specifications. Finally, we introduce generalized instituti

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

The theory of strictness analysis for higher order functions

The theory of strictness analysis for higher order functions

引用

workshop on Programs as Data Objects, 1985

作者： Burn, Gl Hankin, Cl Abramsky, S. GEC Hirst Research Centre East Lane WembleyMiddxHA9 7PP United Kingdom Department of Computing Imperial College of Science and Technology 180 Queen's Gate LondonSW7 2BZ United Kingdom

ISBN: (纸本)9783540164463

Abstract interpretation is a compile-time technique which is used to gain information about a program that may then be used to optimise the execution of the program. A particular use of abstract interpretation is in strictness analysis of functional programs. This provides the key to the exploitation of parallelism in the evaluation of programs written in functional languages. In a language that has lazy semantics, the main potential for parallelism arises in the evaluation of operands of strict operators. A function is strict in an argument if its value is undefined whenever the argument is undefined. If we can use strictness analysis to detect which arguments a function is strict in, we then know that these arguments can be safely evaluated in parallel because this will not affect the lazy semantics. Experimental results suggest that this leads to significant speed-ups. Mycroft was the first person to apply abstract interpretation to the strictness analysis of functional programs. His framework only applies to first-order functions on flat domains. Several workers have proposed practical approaches to strictness analysis of higher-order functions over flat base domains but their work has not been accompanied by extensions to Mycroft's theoretical framework. In this paper we give sound mathematical foundations for this work and discuss some of the practical issues involved. The practical approach is proved correct in relation to the theoretical framework. © 1986, Springer-Verlag.

关键词： functional programming

来源：评论

学校读者我要写书评

暂无评论

Extended ML: An institution-independent framework for formal program development

Extended ML: An institution-independent framework for formal...

引用

workshop on Category Theory and Computer programming, 1985

作者： Sannella, Donald Tarlecki, Andrzej Department of Artificial Intelligience University of Edinburgh United Kingdom Laboratory for Foundations of Computer Science Department of Computer Science University of Edinburgh United Kingdom Institute of Computer Science Polish Academy of Sciences Warsaw Poland

ISBN: (纸本)9783540171621

The Extended ML specification language provides a framework for the formal stepwise development of modular programs in the Standard ML programming language from specifications. The object of this paper is to equip Extended ML with a semantics which is completely independent of the logical system used to write specifications, building on Goguen and Burstall's work on the notion of an institution as a formalisation of the concept of a logical system. One advantage of this is that it permits freedom in the choice of the logic used in writing specifications;an intriguing side-effect is that it enables Extended ML to be used to develop programs in languages other than Standard ML since we view programs as simply Extended ML specifications which happen to include only "executable" axioms. The semantics of Extended ML is defined in terms of the primitive specification-building operations of the ASL kernel specification language which itself has an institution-independent semantics. It is not possible to give a semantics for Extended ML in an institutional framework without extending the notion of an institution;the new notion of an institution with syntax is introduced to provide an adequate foundation for this enterprise. An institution with syntax is an institution with three additions: the category of signatures is assumed to form a concrete category;an additional functor is provided which gives concrete syntactic representations of sentences;and a natural transformation associates these concrete objects with the "abstract" sentences they represent. We use the first addition to "lift" certain necessary set-theoretic constructions to the category of signatures, and the other two additions to deal with the low-level semantics of axioms. © 1986, Springer-Verlag.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Semantics: foundations and Applications 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540475958

ISBN: (纸本)9783540565963

Researchers working on the semantics of programming languages came together in The Netherlands in June 1992 for a workshop on Semantics - foundations and Applications. This volume is based on the meeting and contains material prepared by the lecturers after the meeting took place. The volume includes papers on a wide range of topics in both foundationsand applications, including: - Comparative domain theory, category theory, information systems, - Concurrency: process algebras, asynchronous communication, action semantics, trace nets, process refinement, concurrent constraint programming, - Predicate transformers, refinement,weakest preconditions, - Comparative semantics of programming concepts, full abstraction, - Reasoning about programs: total correctness, epistemic logic, - logic programming, - functional programming: sequentiality, integration with concurrency, applied structured operational semantics. The workshop was an activity of the project REX (Research andEducation in Concurrent Systems) sponsored by the Netherlands NFI (NationaleFaciliteit Informatica) Programme.

关键词： programming Languages, Compilers, Interpreters Data Structures and Information Theory logics and Meanings of Programs programming Techniques Software Engineering

来源：评论

学校读者我要写书评

暂无评论

IV Higher Order workshop, Banff 1990 1

引用

丛书名： workshops in Computing

1000年

作者： Graham Birtwistle

ISBN: (数字)9781447131823

ISBN: (纸本)9783540196600

It is many years since Landin, Burge and others showed us how to apply higher order techniques and thus laid some foundations for modern functional programming. The advantage of higher order descriptions - that they can be very succinct and clear - has been percolating through ever since. Current research topics range from the design, implementation and use of higher order proof assistants and theorem provers, through program specification and verification, and programming language design, to its applications in hardware description and verification. The papers in this book represent the presentations made at a workshop held at Banff, Canada, September 10-14 1990 and organised by the Computer Science Department of the University of Calgary. The workshop gathered together researchers interested in applying higher order techniques to a range of problems. The workshop format had a few (but fairly long) presentations per day. This left ample time for healthy discussion and argument, many of which continued on into the small hours. With so much to choose from, the program had to be selective. This year's workshop was divided into five parts: 1. Expressing and reasoning about concurrency: Warren Burton and Ken Jackson, John Hughes, and Faron Moller. 2. Reasoning about synchronous circuits: Geraint Jones and Mary Sheeran (with a bonus on the fast Fourier transform from Geraint). 3. Reasoning about asynchronous circuits: Albert Camilleri, Jo Ebergen, and Martin Rem. 4. Categorical concepts for programming languages: Robin Cockett, Barry Jay, and Andy Pitts.

关键词： Mathematical logic and Formal Languages programming Techniques Software Engineering

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：