Sciweavers

431 search results - page 2 / 87
» Abstract Data Types in Computer Algebra
Sort
View
JLP
2007
89views more  JLP 2007»
13 years 7 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
AISC
1992
Springer
13 years 11 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
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
14 years 4 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
FORTEST
2008
13 years 9 months ago
Testing Data Types Implementations from Algebraic Specifications
Algebraic specifications of data types provide a natural basis for testing data types implementations. In this framework, the conformance relation is based on the satisfaction of a...
Marie-Claude Gaudel, Pascale Le Gall