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

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 2004年第6期26卷 911-937页

作者： Jay, CB Univ Technol Sydney Broadway NSW 2007 Australia

There is a significant class of operations such as mapping that are common to all data structures. The goal of generic programming is to support these operations on arbitrary data types without having to recode for each new type. The pattern calculus and combinatory type system reach this goal by representing each data structure as a combination of names and a finite set of constructors. These can be used to define generic functions by pattern-matching programs in which each pattern has a different type. Evaluation is type-free. Polymorphism is captured by quantifying over type variables that represent unknown structures. A practical type inference algorithm is provided.

关键词： languages theory constructor calculus functional programming generic programming pattern calculus pattern-matching

来源：评论

学校读者我要写书评

暂无评论

An interval component for continuous constraints

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2004年第1期162卷 79-92页

作者： Granvilliers, L Univ Nantes IRIN F-44322 Nantes 3 France

Local consistency techniques for numerical constraints over interval domains combine interval arithmetic, constraint inversion and bisection to reduce variable domains. In this paper, we study the problem of integrating any specific interval arithmetic library in constraint solvers. For this purpose, we design an interface between consistency algorithms and arithmetic. The interface has a two-level architecture: functional interval arithmetic at low-level, which is only a specification to be implemented by specific libraries, and a set of operations required by solvers, such as relational interval arithmetic or bisection primitives. This work leads to the implementation of an interval component by means of C++ generic programming methods. The overhead resulting from generic programming is discussed. (C) 2003 Elsevier B.V. All rights reserved.

关键词： interval arithmetic consistency techniques constraint solving generic programming C plus

来源：评论

学校读者我要写书评

暂无评论

Flexible fast multipole method for magnetic simulations

引用

IEEE TRANSACTIONS ON MAGNETICS 2004年第4期40卷 2146-2148页

作者： Brown, G Schulthess, TC Apalkov, DM Visscher, PB Oak Ridge Natl Lab Ctr Computat Sci & Comp Sci Oak Ridge TN 37831 USA Oak Ridge Natl Lab Div Math Oak Ridge TN 37831 USA Florida State Univ Sch Computat Sci & Informat Technol Tallahassee FL 32306 USA Univ Alabama Dept Phys & Astron Tuscaloosa AL 35487 USA

The public-domain psi-Mag toolset uses generic-programming techniques to provide the computational magnetic-materials community an excellent opportunity for code reuse without loss of efficiency. psi-Mag provides a flexible implementation of the fast multipole method (FMM) for dipole-dipole calculations that does not depend on the geometry of the problem and is suitable for high-performance, parallel computers. Theoretically, the execution time for such a calculation should grow only linearly with the number of spins, and this is confirmed here for up to order 105 spins. In addition, the implementation efficiently uses a large number of processors. For a test case of 64000 dipoles, the measured speedup is over 25 for 40 processors on a four-processor-per-node IBM SP;this compares quite favorably with less-flexible FMM implementations. The generic implementation allows for easy changes of the basis functions used to expand potentials specific to particular applications, facilitating direct comparison of different approaches. Here, the traditional spherical-harmonic expansions are compared to Cartesian expansions which reflect the cubic symmetries of meshes used in typical micromagnetic simulations.

关键词： distributed algorithms fast multipole method generic programming

来源：评论

学校读者我要写书评

暂无评论

Introducing VAUCANSON

引用

THEORETICAL COMPUTER SCIENCE 2004年第1-2期328卷 77-96页

作者： Lombardy, S Régis-Gianas, Y Sakarovitch, J LTCI CNRS ENST UMR 5141 F-75634 Paris 13 France Univ Paris 07 LIAFA F-75251 Paris 05 France LRDE EPITA F-94276 Le Kremlin Bicetre France

This paper reports on a new software platform called VAUCANSON and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures. The paper successively describes the main features of the VAUCANSON platform, including the fact that the very rich data structure used to implement automata does not weigh too much on the performance, shows how VAUCANSON allows to program algorithms on automata in a way which is very close to the mathematical expression of the algorithm and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency. (C) 2004 Elsevier B.V. All rights reserved.

关键词： automata implementation automata with multiplicity generic programming

来源：评论

学校读者我要写书评

暂无评论

Introducing VAUCANSON

Introducing VAUCANSON

引用

8th International Conference on Implementation and Application of Automata (CIAA 03)

作者： Lombardy, S Régis-Gianas, Y Sakarovitch, J LTCI CNRS ENST UMR 5141 F-75634 Paris 13 France Univ Paris 07 LIAFA F-75251 Paris 05 France LRDE EPITA F-94276 Le Kremlin Bicetre France

关键词： automata implementation automata with multiplicity generic programming

来源：评论

学校读者我要写书评

暂无评论

Scrap more boilerplate:: Reflection, zips, and generalised casts

Scrap more boilerplate:: Reflection, zips, and generalised c...

引用

9th International Conference on Functional programming

作者： Lämmel, R Jones, SP Vrije Univ & CWI Amsterdam Netherlands

Writing boilerplate code is a royal pain. generic programming promises to alleviate this pain by allowing the programmer to write a generic "recipe" for boilerplate code, and use that recipe in many places. In earlier work we introduced the "Scrap your boilerplate" approach to generic programming, which exploits Haskell's existing type-class mechanism to support generic transformations and queries. This paper completes the picture. We add a few extra "introspective" or "reflective" facilities, that together support a rich variety of serialisation and de-serialisation. We also show how to perform generic "zips", which at first appear to be somewhat tricky in our framework. Lastly, we generalise the ability to over-ride a generic function with a type-specific one. All of this can be supported in Haskell with independently-useful extensions: higher-rank types and type-safe cast. The GHC implementation of Haskell readily derives the required type classes for user-defined data types.

关键词： design languages generic programming reflection zippers type cast

来源：评论

学校读者我要写书评

暂无评论

A generic C++ library for solving path problems

A generic C++ library for solving path problems

引用

26th International Conference on Information Technology Interfaces

作者： Botincan, M Univ Zagreb Dept Math Zagreb 10000 Croatia

ISBN: (纸本)9539676991

Path problems are a family of frequently encountered optimization and enumeration problems. Although they are specific each for itself, theory provides a mathematical framework for treatment of path problems in a general way. In this paper we describe a generic C++ library based on algebraic approach for solving path problems. The classes and functions in the library are very compact and written with intention to be extensively combined. In this way many different concrete path problems can be solved by using the same set of programming components.

关键词： path problems algebraic approach semirings generic programming C plus plus programming language

来源：评论

学校读者我要写书评

暂无评论

Parametric Fortran - A program generator for customized generic Fortran extensions 6th

Parametric Fortran - A program generator for customized gene...

引用

6th International Symposium on Practical Aspects of Declarative Languages

作者： Erwig, M Fu, Z Oregon State Univ Sch EECS Corvallis OR 97331 USA

ISBN: (纸本)3540222537

We describe the design and implementation of a program generator that can produce extensions of Fortran that are specialized to support the programming of particular applications. Extensions are specified through parameter structures that can be referred to in Fortran programs to specify the dependency of program parts on these parameters. By providing parameter values, a parameterized Fortran program can be translated into a regular Fortran program. We describe as a real-world application of this program generator the implementation of a generic inverse ocean modeling tool. The program generator is implemented in Haskell and makes use of sophisticated features, such as multi-parameter type classes, existential types, and generic programming extensions and thus represents the application of an advanced applicative language to a real-world problem.

关键词： Fortran generic programming program generation Haskell

来源：评论

学校读者我要写书评

暂无评论

Modular generics

Modular generics

引用

19th Annual ACM Conference on Object-Oriented programming, Systems, Languages, and Applications, OOPSLA'04

作者： Siek, Jeremy Open Systems Laboratory 150 S. Woodlawn Ave. Bloomington IN 47405 United States

来源：评论

学校读者我要写书评

暂无评论

Scrap more boilerplate: reflection, zips, and generalised casts 04

Scrap more boilerplate: reflection, zips, and generalised ca...

引用

Proceedings of the ninth ACM SIGPLAN international conference on Functional programming

作者： Ralf Lämmel Simon Peyton Jones Vrije Universiteit & CWI Amsterdam Microsoft Research Cambridge

ISBN: (纸本)9781581139051

Writing boilerplate code is a royal pain. generic programming promises to alleviate this pain by allowing the programmer to write a generic "recipe" for boilerplate code, and use that recipe in many places. In earlier work we introduced the "Scrap your boilerplate" approach to generic programming, which exploits Haskell's existing type-class mechanism to support generic transformations and *** paper completes the picture. We add a few extra "introspective" or "reflective" facilities, that together support a rich variety of serialisation and de-serialisation. We also show how to perform generic "zips", which at first appear to be somewhat tricky in our framework. Lastly, we generalise the ability to over-ride a generic function with a type-specific *** of this can be supported in Haskell with independently-useful extensions: higher-rank types and type-safe cast. The GHC implementation of Haskell readily derives the required type classes for user-defined data types.

关键词： reflection generic programming zippers type cast

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：