113
click to vote
PPDP
15 years 6 months ago
2007 Springer 
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
108
click to vote
PPDP
15 years 6 months ago
2007 Springer 
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
PPDP
15 years 6 months ago
2007 Springer 
Static analyses provide the semantic foundation for tools ranging from optimizing compilers to refactoring browsers and advanced debuggers. Unfortunately, developing new analysis ...
PPDP
15 years 6 months ago
2007 Springer 
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipul...
112
click to vote
PPDP
15 years 6 months ago
2007 Springer 
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
|
Programming Languages