Sciweavers

23 search results - page 3 / 5
» Proof-Theoretic Foundation of Compilation in Logic Programmi...
Sort
View
103
Voted
PPDP
2007
Springer
15 years 7 months ago
Interactive, scalable, declarative program analysis: from prototype to implementation
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
William C. Benton, Charles N. Fischer
139
Voted
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 6 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
106
Voted
PPDP
2007
Springer
15 years 7 months ago
Relational semantics for effect-based program transformations with dynamic allocation
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
PPDP
2009
Springer
15 years 7 months ago
Relational semantics for effect-based program transformations: higher-order store
We give a denotational semantics to a type and effect system tracking reading and writing to global variables holding values that may include higher-order effectful functions. Reļ...
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...
102
Voted
PEPM
2010
ACM
15 years 9 months ago
Making "stricterness" more relevant
Adapting a strictness analyser to have it take into account explicit strictness annotations can be a tricky business. Straightforward extensions of analyses based on relevance typ...
Stefan Holdermans, Jurriaan Hage