Sciweavers

114 search results - page 4 / 23
» The Formal Consequences of using Variables in CCG Categories
Sort
View
ICFP
2003
ACM
14 years 7 months ago
Verifying CPS transformations in Isabelle/HOL
We have verified several versions of the CPS transformation in Isabelle/HOL. In our verification we adopted first-order abstract syntax with variable names so that the formalizati...
Yasuhiko Minamide, Koji Okuma
CRV
2008
IEEE
295views Robotics» more  CRV 2008»
14 years 2 months ago
3D Human Motion Tracking Using Dynamic Probabilistic Latent Semantic Analysis
We propose a generative statistical approach to human motion modeling and tracking that utilizes probabilistic latent semantic (PLSA) models to describe the mapping of image featu...
Kooksang Moon, Vladimir Pavlovic
CONSTRAINTS
2008
132views more  CONSTRAINTS 2008»
13 years 7 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. Essence is a formal language for specifying combinatorial problems, in a manner similar to natural rigorous specifications that use a mixture of natural language and disc...
Alan M. Frisch, Warwick Harvey, Christopher Jeffer...
ICFP
2004
ACM
14 years 7 months ago
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Useful type inference must be faster than normalization. Otherwise, you could check safety conditions by running the program. We analyze the relationship between bounds on normali...
Harry G. Mairson, Peter Møller Neergaard
FM
1999
Springer
109views Formal Methods» more  FM 1999»
13 years 12 months ago
Compositional Symmetric Sharing in B
Sharing between B constructs is limited, both on the specification and the implementation level. The limitations stem from the single writer/multiple readers paradigm, restricted ...
Martin Büchi, Ralph-Johan Back