1802 search results - page 139 / 361 » Model-based Theory Combination |
TCS
2010
13 years 8 months ago
2010
The refinement calculus of Back, Morgan, Morris, and others is based on monotone predicate transformers (weakest preconditions) where conjunctions stand for demonic choices betwee...
POPL
2012
ACM
12 years 5 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
POPL
2006
ACM
14 years 10 months ago
2006
ACM
This article presents a polymorphic modal type system and its principal type inference algorithm that conservatively extend ML by all of Lisp's staging constructs (the quasi-...
ICCV
2005
IEEE
14 years 3 months ago
2005
IEEE
Most work in computer vision has concentrated on studying the individual effects of motion and illumination on a 3D object. In this paper, we present a theory for combining the ef...
TACS
1991
Springer
14 years 1 months ago
1991
Springer
System F is a well-known typed λ-calculus with polymorphic types, which provides a basis for polymorphic programming languages. We study an extension of F, called F<: (pronoun...