Sciweavers

2206 search results - page 2 / 442
» On the power of coercion abstraction
Sort
View
MPC
2004
Springer
155views Mathematics» more  MPC 2004»
15 years 3 months ago
Inferring Type Isomorphisms Generically
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
Frank Atanassow, Johan Jeuring
AISC
1992
Springer
15 years 1 months ago
A Type-Coercion Problem in Computer Algebra
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 ...
Andreas Weber
JUCS
2006
102views more  JUCS 2006»
14 years 9 months ago
Modeling Inheritance as Coercion in the Kenzo System
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...
César Domínguez, Julio Rubio, Franci...
MFCS
2010
Springer
14 years 8 months ago
Harnessing MLF with the Power of System F
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
Giulio Manzonetto, Paolo Tranquilli
GROUP
2007
ACM
15 years 1 months ago
Community, consensus, coercion, control: cs*w or how policy mediates mass participation
When large groups cooperate, issues of conflict and control surface because of differences in perspective. Managing such diverse views is a persistent problem in cooperative group...
Travis Kriplean, Ivan Beschastnikh, David W. McDon...