Sciweavers

619 search results - page 2 / 124
» Generic Extensions and Generic Polynomials
Sort
View
ISSAC
1999
Springer
116views Mathematics» more  ISSAC 1999»
13 years 10 months ago
On the Genericity of the Modular Polynomial GCD Algorithm
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm for multivariate polynomials over Euclidean domains which have a special kind of ...
Erich Kaltofen, Michael B. Monagan
IFL
2001
Springer
137views Formal Methods» more  IFL 2001»
13 years 10 months ago
A Generic Programming Extension for Clean
Abstract. Generic programming enables the programmer to define functions by induction on the structure of types. Defined once, such a generic function can be used to generate a s...
Artem Alimarine, Marinus J. Plasmeijer
ICFP
2005
ACM
14 years 6 months ago
Scrap your boilerplate with class: extensible generic functions
The `Scrap your boilerplate' approach to generic programming allows the programmer to write generic functions that can traverse arbitrary data structures, and yet have type-s...
Ralf Lämmel, Simon L. Peyton Jones
DSL
2009
13 years 3 months ago
Gel: A Generic Extensible Language
Abstract. Both XML and Lisp have demonstrated the utility of generic syntax for expressing tree-structured data. But generic languages do not provide the syntactic richness of cust...
Jose Falcon, William R. Cook
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 6 months ago
Intersection Theory for Generic Differential Polynomials and Differential Chow Form
In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension d and order h with a g...
Xiao-Shan Gao, Wei Li, Chun-Ming Yuan