430 search results - page 50 / 86 » Extracting Computer Algebra Programs from Statements |
EUROPAR
2005
Springer
14 years 1 months ago
2005
Springer
A style for programming problems from matrix algebra is developed with a familiar example and new tools, yielding high performance with a couple of surprising exceptions. The under...
MSR
2006
ACM
14 years 1 months ago
2006
ACM
Software may contain functionality that does not align with its architecture. Such cross-cutting concerns do not exist from the beginning but emerge over time. By analysing where ...
FOSSACS
1998
Springer
13 years 12 months ago
1998
Springer
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
AAAI
1990
13 years 9 months ago
1990
Automating proofs by induction is important in many computer science and artificial intelligence applications, in particular in program verification and specification systems. We ...
JFP
2000
13 years 7 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...