610 search results - page 72 / 122 » Fast Modular Reduction |
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
ICFP
2006
ACM
14 years 8 months ago
2006
ACM
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We use coalgebraic methods to describe finitely generated free Heyting algebras. Heyting algebras are axiomatized by rank 0-1 axioms. In the process of constructing free...
ICDE
2008
IEEE
14 years 3 months ago
2008
IEEE
— We describe blogTrust, an innovative modular and extensible prototype application for monitoring changes in the interests of blogosphere participants. We also propose a new app...
IROS
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— This paper presents Meld, a programming language for modular robots, i.e., for independently executing robots where inter-robot communication is limited to immediate ne...