1988
DOI: 10.1007/978-1-4684-7074-1_7
|View full text |Cite
|
Sign up to set email alerts
|

Scratchpad II: An Abstract Datatype System for Mathematical Computation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

1989
1989
1994
1994

Publication Types

Select...
1
1
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…A number of computer algebra systems with object-oriented features have been developed during recent years. One of the best known is the AXI0.\1 system [22J, a descendant of SCRATCH-PAD [23], which has a type system that in some sense is object-oriented, even though the language constructs provided are different from the ones usually found in object-oriented languages. Another example is the Mathematiea-inspired system AlgBench [24], which extends the pattern matching of Mathematica to inheritance-based unification.…”
Section: Related Workmentioning
confidence: 99%
“…A number of computer algebra systems with object-oriented features have been developed during recent years. One of the best known is the AXI0.\1 system [22J, a descendant of SCRATCH-PAD [23], which has a type system that in some sense is object-oriented, even though the language constructs provided are different from the ones usually found in object-oriented languages. Another example is the Mathematiea-inspired system AlgBench [24], which extends the pattern matching of Mathematica to inheritance-based unification.…”
Section: Related Workmentioning
confidence: 99%
“…Here, a +-> b is Scratchpad II notation for the anonymous function a → b. 6 Now the recursive calls to integrate are able to access the leading terms of the series computed so far. When defined this way, the exponential function evaluates each term only once.…”
Section: Using Fixed Point Operators For Seriesmentioning
confidence: 99%
“…Scratchpad [Jenks et al, 1988] is a computer algebra system based on the "abstract data type" view of computing, where the various data types are constructed from elementary ones, such as Integer, by means of functors (functions which return types) such as Sparse-UnivariatePolynomial or Fraction. The types consist of a data representation and operations, so that a type such as List(Integer) provides the operations length etc.…”
Section: Introductionmentioning
confidence: 99%