222 search results - page 20 / 45 » Subject Reduction of Logic Programs as Proof-Theoretic Prope... |
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
SIGSOFT
2004
ACM
14 years 8 months ago
2004
ACM
Dynamic detection of likely invariants is a program analysis that generalizes over observed values to hypothesize program properties. The reported program properties are a set of ...
JFP
2002
13 years 7 months ago
2002
We present CIL , a typed -calculus which serves as the foundation for a typed intermediate language for optimizing compilers for higher-order polymorphic programming languages. Th...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
ICFP
2000
ACM
13 years 12 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...