Sciweavers

277 search results - page 11 / 56
» A First-Order Theory of Types and Polymorphism in Logic Prog...
Sort
View
POPL
2007
ACM
14 years 7 months ago
Modular type classes
ML modules and Haskell type classes have proven to be highly effective tools for program structuring. Modules emphasize explicit configuration of program components and the use of...
Derek Dreyer, Robert Harper, Manuel M. T. Chakrava...
ICFP
2007
ACM
14 years 7 months ago
A generic usage analysis with subeffect qualifiers
Sharing analysis and uniqueness typing are static analyses that aim at determining which of a program's objects are to be used at most once. There are many commonalities betw...
Jurriaan Hage, Stefan Holdermans, Arie Middelkoop
ICFP
2008
ACM
14 years 7 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
TACAS
2010
Springer
151views Algorithms» more  TACAS 2010»
13 years 5 months ago
A Polymorphic Intermediate Verification Language: Design and Logical Encoding
Abstract. Intermediate languages are a paradigm to separate concerns in software verification systems when bridging the gap between programming languages and the logics understood ...
K. Rustan M. Leino, Philipp Rümmer
TLDI
2003
ACM
110views Formal Methods» more  TLDI 2003»
14 years 24 days ago
Type-safe multithreading in cyclone
We extend Cyclone, a type-safe polymorphic language at vel of abstraction, with threads and locks. Data races can violate type safety in Cyclone. An extended type system staticall...
Dan Grossman