Sciweavers

211 search results - page 6 / 43
» On the Proof Theory of the Existence Predicate
Sort
View
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
MOC
1998
104views more  MOC 1998»
13 years 7 months ago
Chaos in the Lorenz equations: A computer assisted proof. Part II: Details
Abstract. Details of a new technique for obtaining rigorous results concerning the global dynamics of nonlinear systems is described. The technique abstract existence results based...
Konstantin Mischaikow, Marian Mrozek
QEST
2007
IEEE
14 years 1 months ago
Probabilistic Model Checking Modulo Theories
— Probabilistic models are widely used to analyze embedded, networked, and more recently biological systems. Existing numerical analysis techniques are limited to finitestate mo...
Björn Wachter, Lijun Zhang, Holger Hermanns
FSS
2010
97views more  FSS 2010»
13 years 6 months ago
An early approach toward graded identity and graded membership in set theory
The paper considers an early approach toward a (fuzzy) set theory with a graded membership predicate and a graded equality relation which had been developed by the German mathemat...
Siegfried Gottwald
IFM
2007
Springer
14 years 1 months ago
Unifying Theories of Objects
We present an approach to modelling Abadi–Cardelli-style object calculi as Unifying Theories of Programming (UTP) designs. Here we provide a core object calculus with an operatio...
Michael Anthony Smith, Jeremy Gibbons