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

Generalised folds for nested datatypes

Formal Aspects of Computing 1999年第2期11卷 200-222页

作者： Bird, Richard Paterson, Ross Programming Research Group Oxford University Oxford United Kingdom Department of Computer Science City University London United Kingdom Programming Research Group Oxford University Wolfson Building Parks Road Oxford OX1 3QD United Kingdom

Nested datatypes generalise regular datatypes in much the same way that context-free languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, the fold functions are more limited because they can only describe natural transformations. Practical considerations therefore dictate the introduction of a generalised fold function in which this limitation can be overcome. In the paper we show how to construct generalised folds systematically for each nested datatype, and show that they possess a uniqueness property analogous to that of ordinary folds. As a consequence, generalised folds satisfy fusion properties similar to those developed for regular datatypes. Such properties form the core of an effective calculational theory of inductive datatypes.

关键词： Keywords: Functional programming Program construction

来源：评论

学校读者我要写书评

暂无评论

A Minimal Graphical User Interface for the Jape Proof Calculator

引用

Formal Aspects of Computing 1999年第3期11卷 244-271页

作者： Bornat, Richard Sufrin, Bernard Programming Research Group University of Oxford Oxford United Kingdom Department of Computer Science Queen Mary and Westfield College University of London London E1 4NS United Kingdom

GUI design isn't simply a matter of putting a nice front-end on a capable program. It requires thought about the way in which people might be expected to use a system, and investigation of the ways that they actually use it. Jape's GUI has been designed to be as simple as possible, so that it will not get in the way of the business of proof. It is designed to be minimal in the information that it displays and the gestures that it requires from the user. In this paper we introduce and give a rationale for the design of Jape's user interface, then note some of its drawbacks.

关键词： Keywords: GUI proof Proof calculator

来源：评论

学校读者我要写书评

暂无评论

GIDTS - A Graphical programming Environment for Prolog

GIDTS - A Graphical Programming Environment for Prolog

引用

1999 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, PASTE 1999

作者： Kókai, Gabriella Nilson, Jörg Niss, Christian Department of Computer Science Programming Languages Friedrich-Alexander-University of Erlangen-Nürnberg Martensstr. 3 ErlangenD-91058 Germany

ISBN: (纸本)9781581131376

This paper puts forward the Graphical Interactive Diagnosing, Testing and Slicing System (GIDTS) which is a graphical programming environment for PROLOG programs. The IDTS part of the system integrates Shapiro's Interactive Diagnosis Algorithm with the Category Partition Testing Method (CPM) and a slicing technique performing the algorithmic debugging and functional testing of PROLOG programs. The integration of IDTS with a graphical user interface (GUI) supports the whole functionality of IDTS and provides a user-friendly environment giving the user more information on the state of the debugging process. GIDTS extends IDTS to a complete programming environment. It allows one to handle the debugging of complex programs using the extended syntax and semantics of PROLOG in a very flexible way. A static code diagnosis has also been implemented. In addition GIDTS supports debugging-directed editing of the source program, and a quick source code navigation via any of the tools (for example: the debugger, the static call graph and the information retriever). All these features are supported by the graphical user interface. © 1999 ACM

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Information theoretical approach to minimization of AND/EXOR expressions of switching functions

Information theoretical approach to minimization of AND/EXOR...

引用

4th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Services, ITELSIKS 1999

作者： Shmerko, V. Popel, D. Stanković, R.S. Cheushev, V. Yanushkevich, S. Department of Computer Aided Design Systems Techinal University of Szczecin Poland Department of Computer Sicience State University of Informatics and Radioelectronics Minks Belarus Department of Computer Science Faculty of Electronic Engineering University of Nis Serbia Department of Programming Technologies State University Minsk Belarus

ISBN: (纸本)078035768X

In modern circuit design, the Shannon decomposition of switching functions is widely used. On the other hand, in information theory of telecommunication, the Shannon entropy used as a measure to represent the information in numerical values, is a key notion. In this paper, we relate these two concepts, belonging to different areas, into an approach to the minimisation of exclusive-or sum-of-products (AND/EXOR) expressions for switching functions. The Shannon decomposition, and the closely related Davio decomposition for AND/EXOR expressions are interpreted in terms of basic concepts in the information theory. Thanks to that, we have proposed an entropy based strategy for minimization of AND/EXOR expressions. We have provided a comparison and an experimental verification of this strategy with some known heuristic minimization strategies using benchmarks. In some cases, our program Info-EXOR produces extremely better results. Moreover, the information theory interpretation of classical decomposition of switching functions offers a new point of view to the existing design styles. © 1999 IEEE.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

Genetic programming as a darwinian invention machine 2nd

引用

2nd European Workshop on Genetic programming, EuroGP 1999

作者： Koza, John R. Bennett, Forrest H. Stiffelman, Oscar Section on Medical Informatics Department of Medicine StanfordCA94305 United States Genetic Programming Inc Los AltosCA94023 United States Computer Science Department Stanford University StanfordCA94305 United States

ISBN: (纸本)3540658998

Genetic programming is known to be capable of creating designs that satisfy prespecified high-level design requirements for analog electrical circuits and other complex structures. However, in the real world, it is often important that a design satisfy various non-technical requirements. One such requirement is that a design not possess the key characteristics of any previously known design. This paper shows that genetic programming can be used to generate novel solutions to a design problem so that genetic programming may be potentially used as an invention machine. This paper turns the clock back to the period just before the time (1917) when George Campbell of American Telephone and Telegraph invented and patented the design for an electrical circuit that is now known as the ladder filter. Genetic programming is used to reinvent the Campbell filter. The paper then turns the clock back to the period just before the time (1928) when Wilhelm Cauer invented and patented the elliptic filter. Genetic programming is then used to reinvent a technically equivalent filter that avoids the key characteristics of then-preexisting Campbell filter. Genetic programming can be used as an invention machine by employing a two-part fitness measure that incorporates both the degree to which an individual in the population satisfies the given technical requirements and the degree to which the individual does not possess the key characteristics of preexisting technology. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Formal specification of virtual process topologies

Formal specification of virtual process topologies

引用

IEEE International Conference on Cluster Computing

作者： K. Kazemi C. McDonald Programming Languages and Systems Group Department of Computer Science University of Western Australia Nedlands WA Australia

A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel programming environment provides high level abstractions for interprocess communication, relieving the application developer of the cumbersome task of mapping logical neighbours to their task identifiers within message passing systems. The novel approach of separating topological specification from the APIs provided extreme flexibility to the developers of the applications using regular topologies. We believed that the task of supporting process topologies could be made even easier and, in this paper present our new method which uses recurrence relations to define topologies. Within the new environment, the recurrence relationships can be passed to the topology server which then is used in the generation of the topological specification.

关键词： Formal specifications Message passing Libraries Network topology Workstations Supercomputers computer languages computer science Read only memory Network servers

来源：评论

学校读者我要写书评

暂无评论

De Bruijn notation as a nested datatype

引用

Journal of Functional programming 1999年第1期9卷 77-91页

作者： Bird, Richard S. Paterson, Ross Programming Research Group Oxford University Wolfson Building Oxford OX1 3QD Parks Road United Kingdom Department of Computer Science City University London EC1V 0HB Northampton Square United Kingdom

de Bruijn notation is a coding of lambda terms in which each occurrence of a bound variable x is replaced by a natural number, indicating the 'distance' from the occurrence to the abstraction that introduced x. One might suppose that in any datatype for representing de Bruijn terms, the distance restriction on numbers would have to maintained as an explicit datatype invariant. However, by using a nested (or non-regular) datatype, we can define a representation in which all terms are well-formed, so that the invariant is enforced automatically by the type system. programming with nested types is only a little more difficult than programming with regular types, provided we stick to well-established structuring techniques. These involve expressing inductively defined functions in terms of an appropriate fold function for the type, and using fusion laws to establish their properties. In particular, the definition of lambda abstraction and beta reduction is particularly simple, and the proof of their associated properties is entirely mechanical.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient techniques for distributed implementation of search-based AI systems

Efficient techniques for distributed implementation of searc...

引用

International Conference on Parallel Processing (ICPP)

作者： G. Gupta E. Pontelli Laboratory for Logic Databases and Advanced Programming Department of Computer Science New Mexico State University Las Cruces NM USA

We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing or-parallelism, which when coupled with appropriate scheduling strategies leads to: (i) reduced communication during distributed execution; and, (ii) distribution of larger grain- sized work to processors. The modified technique can also be implemented on shared memory machines and should be quite competitive with existing methods. Indeed, an implementation has been carried out on shared memory machines, and the results are reported here.

关键词： Artificial intelligence Parallel processing Logic programming Laboratories Databases computer science Read only memory Artificial neural networks Tree graphs Image recognition

来源：评论

学校读者我要写书评

暂无评论

Information theoretical approach to minimization of AND/EXOR expressions of switching functions

Information theoretical approach to minimization of AND/EXOR...

引用

International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service (TELSIKS)

作者： V. Shmerko D. Popel R.S. Stankovic V. Cheushev S. Yanushkevich Department of Computer Aided Design Systems Technical University of Szczecin Poland Department of Computer Science State University of Informatics and Radioelectronics of Belarus Minsk Belarus Department of Computer Science University of Nis Yugoslavia Department of Programming Technologies State University Minsk Belarus

关键词： Minimization Entropy Information theory Switching circuits Telecommunication switching Circuit synthesis Data structures Boolean functions Electronic mail Logic design

来源：评论

学校读者我要写书评

暂无评论

RPO constraint solving is in NP 12th

引用

12th International Workshop on computer science Logic, CSL 1998 held as the Annual Conference of the European Association for computer science Logic, EACSL 1998

作者： Narendran, Paliath Rusinowitch, Michael Verma, Rakesh Institute of Programming and Logics Department of Computer Science State University of New York at Albany AlbanyNY12222 United States LORIA 615 rue du jardin botanique BP 101 Villers les Nancy cedex54602 France Dept. of Comp. Science University of Houston HoustonTX77204 United States

ISBN: (纸本)3540659226

A new decision procedure for the existential fragment of ordering constraints expressed using the recursive path ordering is presented. This procedure is nondeterministic and checks whether a set of constraints is solvable over the given signature, i.e., the signature over which the terms in the constraints are defined. It is shown that this non-deterministic procedure runs in polynomial time, thus establishing the membership of this problem in the complexity class NP for the first time. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：