Sciweavers

4352 search results - page 4 / 871
» A Representation Theorem and Applications
Sort
View
CAGD
2006
97views more  CAGD 2006»
13 years 10 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
FASE
2000
Springer
14 years 1 months ago
More About TAS and IsaWin - Tools for Formal Program Development
We present a family of tools for program development and verification, comprising the transformation system TAS and the theorem proving interface IsaWin. Both are based on the theo...
Christoph Lüth, Burkhart Wolff
ENTCS
2007
109views more  ENTCS 2007»
13 years 10 months ago
Free Theorems and Runtime Type Representations
’s abstraction theorem [21], often referred to as the parametricity theorem, can be used to derive properties about functional programs solely from their types. Unfortunately, i...
Dimitrios Vytiniotis, Stephanie Weirich
JSYML
2008
74views more  JSYML 2008»
13 years 10 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
KI
1990
Springer
14 years 2 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz