Sciweavers

306 search results - page 18 / 62
» Constructive algebraic integration theory
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 12 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
CORR
2004
Springer
100views Education» more  CORR 2004»
14 years 11 months ago
On the Theory of Structural Subtyping
We show that the first-order theory of structural subtyping of non-recursive types is decidable. Let be a language consisting of function symbols (representing type constructors)...
Viktor Kuncak, Martin C. Rinard
OOPSLA
2005
Springer
15 years 5 months ago
Generalized algebraic data types and object-oriented programming
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
Andrew Kennedy, Claudio V. Russo
ICST
2008
IEEE
15 years 6 months ago
Testing Java Components based on Algebraic Specifications
This paper presents a method of component testing based on algebraic specifications. An algorithm for generating checkable test cases is proposed. A prototype testing tool called ...
Bo Yu, Liang Kong, Yufeng Zhang, Hong Zhu
AMAI
2007
Springer
14 years 12 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...