427 search results - page 25 / 86 » Inductive reasoning about effectful data types |
POPL
2008
ACM
14 years 7 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
JOCN
2011
13 years 2 months ago
2011
■ Defeasible inferences are inferences that can be revised in the light of new information. Although defeasible inferences are pervasive in everyday communication, little is kno...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We develop a flexible information-flow type system for a range of encryption primitives, precisely reflecting their diverse functional and security features. Our rules enable e...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
TLDI
2009
ACM
14 years 4 months ago
2009
ACM
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...