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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3080卷 227-243页

作者： Kleiner, Niko Dept. of Programming Methodology Faculty of Computer Science University of Ulm D-89069 Germany

One of the most difficult tasks in the development of Processaware Information Systems (p-IS) is the design of the related workflow. Methods and tools to support this design process are an emerging trend in Business Process Management research. Despite the many approaches already presented it is unclear on what researchers should focus. Hence, in this paper, I first undertake a sound problem analysis of the workflow design process. With respect to this analysis, workflow design should primarily be informed of the study of the 'where' and 'why' of deviations of the work practice - which emerges with the deployment and use of the new p-IS - and the initially intended business process. Secondly, I describe log-based Delta-Analysis, a new concept to study process deviations using data logged during operational p-IS-usage. InterPoL, a tool to support log-based Delta-Analysis, is also presented. Finally, I report about results of a feasibility as well as a detailed case study with real-world projects. © Springer-Verlag 2004.

关键词： Enterprise resource management

来源：评论

学校读者我要写书评

暂无评论

Using types as search keys in function libraries 89

Using types as search keys in function libraries

引用

4th International Conference on Functional programming Languages and Computer Architecture, FPCA 1989

作者： Rittri, Mikael Programming Methodology Group Dept. of Computer Sciences Chalmers U. of Tech. and U. of Göteborg GöteborgS-412 96 Sweden

ISBN: (纸本)0897913280

A method is proposed to search for an identifier by using its type as a key. This can be seen as an approximation of using the specification as a key. Functions that only differ in their currying or argument order are essentially the same, which is expressed by a congruence relation on types. Isomorphism in Cartesian closed categories is used for this purpose. Simpler put, types are regarded as congruent if they are equal under an arithmetical interpretation, with Cartesian product as multiplication and function space as exponentiation. The congruence is characterized by seven axioms, and there is an efficient decision algorithm. A search system for Lazy ML has been implemented;its performance is promising. © 1989 ACM.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

Concrete syntax for data objects in functional languages 88

Concrete syntax for data objects in functional languages

引用

1988 ACM Conference on LISP and Functional programming, LFP 1988

作者： Aasa, Annika Petersson, Kent Synek, Dan Programming Methodology Group Dept. of Computer Science Univ. of Göteborg and Chalmers GöteborgS-412 96 Sweden

ISBN: (纸本)089791273X

Introduction: Many functional languages have a construction to define inductive data types [Hoa75] (also called general structured types [Pey87], structures [Lan64], datatypes [Mil84] and free algebras [GTWW77]). An inductive definition of a data type can also be seen as a grammar for a language and the elements of the data type as the phrases of the language. So defining an inductive data type can be seen as introducing an embedded language of values into the programming language. This correspondence is however not fully exploited in existing functional languages. The elements can presently only be written in a very restricted form. They are just the parse trees of the elements written in prefix form. A generalization, that we will consider in this paper, is to allow the elements to be written in a more general form. Instead of directly writing the parse trees of the embedded language, we would like to use a more concrete syntactical form and let an automatically generated parser translate the concrete syntactical form to the corresponding parse tree. We think that this is especially useful when we manipulate languages in programs, for example, when implementing compilers, interpreters, program transformation systems, and programming logics. It is also convenient if we want to use the concrete syntax for other kinds of data in a program. © 1988 ACM.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：