Sciweavers

144 search results - page 2 / 29
» Bases in Orlik-Solomon Type Algebras
Sort
View
QSIC
2003
IEEE
13 years 10 months ago
A Note on Test Oracles and Semantics of Algebraic Specifications
Algebraic testing is an automated software testing method based on algebraic formal specifications. It tests if a program correctly implements an algebraic specification by checki...
Hong Zhu
ATVA
2008
Springer
143views Hardware» more  ATVA 2008»
13 years 7 months ago
Automating Algebraic Specifications of Non-freely Generated Data Types
Abstract. Non-freely generated data types are widely used in case studies carried out in the theorem prover KIV. The most common examples are stores, sets and arrays. We present an...
Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif
HASKELL
2006
ACM
13 years 11 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton
SAS
1993
Springer
104views Formal Methods» more  SAS 1993»
13 years 9 months ago
Strictness Properties of Lazy Algebraic Datatypes
A new construction of a finite set of strictness properties for any lazy algebraic datatype is presented. The construction is based on the categorical view of the solutions to the...
P. N. Benton
APLAS
2004
ACM
13 years 10 months ago
Build, Augment and Destroy, Universally
Abstract. We give a semantic footing to the fold/build syntax of programming with inductive types, covering shortcut deforestation, based on a universal property. Specifically, we...
Neil Ghani, Tarmo Uustalu, Varmo Vene