16 search results - page 1 / 4 » Computing with Coercions |
AISC
1992
Springer
13 years 9 months ago
1992
Springer
Abstract. An important feature of modern computer algebra systems is the support of a rich type system with the possibility of type inference. Basic features of such a type system ...
JUCS
2006
13 years 4 months ago
2006
Abstract: In this paper the analysis of the data structures used in a symbolic computation system, called Kenzo, is undertaken. We deal with the specification of the inheritance re...
LFP
1990
13 years 6 months ago
1990
d Abstract) V. Breazu-Tannen C. A. Gunter A. Scedrov University of Pennsylvania This paper relates two views of the operational semantics of a language with multiple
ICCS
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The unpredictable run-time configurations of dynamic, datadriven application systems require flexible simulation components that can adapt to changes in the number of i...
AISC
1994
Springer
13 years 9 months ago
1994
Springer
This paper investigates some soundness conditions which have to be fulfilled in systems with coercions and generic operators. A result of Reynolds on unrestricted generic operators...