430 search results - page 19 / 86 » Extracting Computer Algebra Programs from Statements |
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We propose a naive version of action semantics that begins with a selection of “transient” and “persistent” facets, each characterized as a partial monoid. Yielders are de...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Friedman showed how to turn a classical proof of a Σ0 1 formula into an intuitionistic proof of the same formula, thus giving an effective method to extract witnesses from classi...
ECOOPW
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
The impact of types on the algebraic theory of the π-calculus is studied. The type system has capability types. They allow one to distinguish between the ability to read from a c...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs (from now on, computational kernel...