Sciweavers

1059 search results - page 172 / 212
» Standard Logics Are Valuation-Nonmonotonic
Sort
View
ICFP
2007
ACM
14 years 9 months ago
A type system for recursive modules
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
Derek Dreyer
ICFP
2003
ACM
14 years 9 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
PLDI
2010
ACM
14 years 7 months ago
Ur: Statically-Typed Metaprogramming with Type-Level Record Computation
Dependent types provide a strong foundation for specifying and verifying rich properties of programs through type-checking. The earliest implementations combined dependency, which...
Adam Chlipala
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
14 years 6 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
DATE
2009
IEEE
168views Hardware» more  DATE 2009»
14 years 4 months ago
Selective state retention design using symbolic simulation
Abstract—Addressing both standby and active power is a major challenge in developing System-on-Chip designs for batterypowered products. Powering off sections of logic or memorie...
Ashish Darbari, Bashir M. Al-Hashimi, David Flynn,...