163 search results - page 15 / 33 » Type Systems for Useless-Variable Elimination |
PEPM
1994
ACM
13 years 10 months ago
1994
ACM
One of the most novel features in the functional programming language Haskell is the system of type classes used to support a combination of overloading and polymorphism. Current ...
EUROSYS
2007
ACM
14 years 3 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...
ICVS
2009
Springer
13 years 4 months ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
JAR
2010
13 years 5 months ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...