Sciweavers

Share
42 search results - page 1 / 9
» The Specialization and Transformation of Constructive Existe...
Sort
View
IJCAI
1989
12 years 3 months ago
The Specialization and Transformation of Constructive Existence Proofs
The transformation of constructive program synthesis proofs is discussed and compared with the more traditional approaches to program transformation. An example system for adaptin...
Peter Madden
MFCS
2005
Springer
12 years 7 months ago
On Beta-Shifts Having Arithmetical Languages
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
Jakob Grue Simonsen
DM
2006
128views more  DM 2006»
12 years 2 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck
FOSSACS
2010
Springer
12 years 8 months ago
Toward a Compositional Theory of Leftist Grammars and Transformations
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
Pierre Chambart, Ph. Schnoebelen
LPAR
2004
Springer
12 years 7 months ago
Knowledge-Based Synthesis of Distributed Systems Using Event Structures
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
Mark Bickford, Robert L. Constable, Joseph Y. Halp...
books