Sciweavers

504 search results - page 20 / 101
» Definitional Reflection and the Completion
Sort
View
CADE
2006
Springer
14 years 7 months ago
Towards Self-verification of HOL Light
The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would ...
John Harrison
CADE
2006
Springer
14 years 7 months ago
Using the TPTP Language for Writing Derivations and Finite Interpretations
One of the keys to the success of the TPTP and related projects is their consistent use of the TPTP language. The ability of the TPTP language to express solutions as well as probl...
Geoff Sutcliffe, Stephan Schulz, Koen Claessen, Al...
ECBS
2004
IEEE
129views Hardware» more  ECBS 2004»
13 years 11 months ago
Closing the Gap Between Software Modelling and Code
If a software implementation is to be generated fully automatically from a model, then the model must be detailed and totally complete. For the definition of software implementing...
Ferdinand Wagner, T. Wagner, Peter Wolstenholme
COMPSAC
1998
IEEE
13 years 11 months ago
The Essence of the Visitor Pattern
Abstract. For object-oriented programming, the Visitor pattern enables the definition of a new operation on an object structure without changing the classes of the objects. The pri...
Jens Palsberg, C. Barry Jay
ICCV
2005
IEEE
14 years 9 months ago
BRDF Invariant Stereo Using Light Transport Constancy
Nearly all existing methods for stereo reconstruction assume that scene reflectance is Lambertian, and make use of color constancy as a matching invariant. We introduce a new inva...
James E. Davis, Ruigang Yang, Liang Wang