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

STRUCTURE CLASHES - AN ALTERNATIVE TO PROGRAM INVERSION

COMPUTER JOURNAL 1990年第2期33卷 126-132页

作者： DROMEY, RG CHORVAT, TA Programming Methodology Research Group Computing and Information Technology Griffith University Nathan Brisbane 4111Australia

A method for handling boundary structure clashes is presented. It provides a simple alternative to Jackson's program inversiontechnique. It is a constructive approach based on the use of prototypes. Development begins by solving the corresponding simplerproblem that has no structure clashes. This solution is then used to guide the solution of the original problem. Programsconstructed in this way preserve the correspondence between the program control structure and the data structure. They shouldtherefore be easier to maintain than their counterparts developed using Jackson's program inversion *** May 1988. revised August 1988.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Views: A way for pattern matching to Cohabit with data abstraction 87

Views: A way for pattern matching to Cohabit with data abstr...

引用

14th ACM SIGACT-SIGPLAN Symposium on Principles of programming Languages, POPL 1987

作者： Wadler, Philip Programming Research Group Oxford University United Kingdom Programming Methodology Group Chalmers University Sweden

ISBN: (纸本)0897912152

Pattern matching and data abstraction are important concepts in designing programs, but they do not fit well together. Pattern matching depends on making public a free data type representation, while data abstraction depends on hiding the representation. This paper proposes the views mechanism as a means of reconciling this conflict. A view allows any type to be viewed as a free data type, thus combining the clarity of pattern matching with the efficiency of data abstraction.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

A new array operation

A new array operation

引用

International Workshop on Graph Reduction, 1986

作者： Wadler, Philip Programming Research Group Oxford University United Kingdom Programming Methodology Group Chalmers University Göteborg Sweden

ISBN: (纸本)9783540184201

A new monolithic array operation has been proposed. The operation is similar to earlier proposals, except that it uses the fold operation to combine multiple values with the same index. The new operation conveniently handles certain important kinds of computation, such as histogram, and provides parallelism in a convenient way. This method solves the important problem of calculating histograms in a fashion suitable for parallel computation. I-structures, devised by Arvind and his colleagues, sacrifice referential transparency in order to increase the opportunities for parallelism, but do not provide a good solution to the histogram problem. I am grateful to Arvind for pointing out this defect of I-structures, which in turn inspired this paper. Although the method presented here is useful for an important class of problems, it is not the best solution for all problems involving arrays. Further experience is needed to assess its advantages and shortcomings. © 1987, Springer-Verlag.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Projections for strictness analysis 3rd

引用

3rd International Conference on Functional programming Languages and Computer Architecture, 1987

作者： Wadler, Philip Hughes, R.J.M. Programming Research Group Oxford University United Kingdom Programming Methodology Group Chalmers University Göteborg Sweden Department of Computer Science University of Glasgow United Kingdom

ISBN: (纸本)9783540183174

Contexts have been proposed as a means of performing strictness analysis on non-flat domains. Roughly speaking, a context describes how much a sub-expression will be evaluated by the surrounding program. This paper shows how contexts can be represented using the notion of projection from domain theory. This is clearer than the previous explanation of contexts in terms of continuations. In addition, this paper describes finite domains of contexts over the non-flat list domain. This means that recursive context equations can be solved using standard fixpoint techniques, instead of the algebraic manipulation previously used. © 1987, Springer-Verlag.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：