Sciweavers

359 search results - page 20 / 72
» On Complete Primitives for Fairness
Sort
View
IFL
2001
Springer
13 years 12 months ago
Proving the Correctness of the STG Machine
Abstract. J. Launchbury gave an operational semantics for lazy evaluation and showed that it is sound and complete w.r.t. a denotational s of the language. P. Sestoft then introduc...
Alberto de la Encina, Ricardo Pena
JOLLI
2002
141views more  JOLLI 2002»
13 years 7 months ago
Naming Worlds in Modal and Temporal Logic
In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x...
Dov M. Gabbay, G. Malod
CADE
2005
Springer
14 years 7 months ago
Reasoning in Extensional Type Theory with Equality
Abstract. We describe methods for automated theorem proving in extensional type theory with primitive equality. We discuss a complete, cut-free sequent calculus as well as a compac...
Chad E. Brown

Book
376views
15 years 4 months ago
An Exploration of Random Processes for Engineers
"From an applications viewpoint, the main reason to study the subject of these notes is to help deal with the complexity of describing random, time-varying functions. A random...
Bruce Hajek
CVPR
2008
IEEE
14 years 9 months ago
Shading models for illumination and reflectance invariant shape detectors
Many objects have smooth surfaces of a fairly uniform color, thereby exhibiting shading patterns that reveal information about its shape, an important clue to the nature of the ob...
Peter Nillius, Josephine Sullivan, Antonis A. Argy...