Sciweavers

1263 search results - page 99 / 253
» Packaging Mathematical Structures
Sort
View
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
15 years 11 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
MPC
2010
Springer
159views Mathematics» more  MPC 2010»
15 years 11 months ago
Subtyping, Declaratively
Abstract. It is natural to present subtyping for recursive types coinductively. However, Gapeyev, Levin and Pierce have noted that there is a problem with coinductive definitions ...
Nils Anders Danielsson, Thorsten Altenkirch
ISSAC
1994
Springer
165views Mathematics» more  ISSAC 1994»
15 years 10 months ago
Constructing Permutation Representations for Large Matrix Groups
New techniques, both theoretical and practical, are presented for constructing a permutation representation for a matrix group. We assume that the resulting permutation degree, n,...
Gene Cooperman, Larry Finkelstein, Bryant W. York,...
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 9 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
CF
2005
ACM
15 years 8 months ago
Sparse matrix storage revisited
In this paper, we consider alternate ways of storing a sparse matrix and their effect on computational speed. They involve keeping both the indices and the non-zero elements in t...
Malik Silva