Sciweavers

294 search results - page 29 / 59
» Relation between Semantic Completeness and Syntax Completene...
Sort
View
SAS
2005
Springer
14 years 1 months ago
A Generic Framework for Interprocedural Analysis of Numerical Properties
Abstract. In his seminal paper [5], Granger presents an analysis which infers linear congruence relations between integer variables. For affine programs without guards, his analys...
Markus Müller-Olm, Helmut Seidl
POPL
2007
ACM
14 years 8 months ago
Generative unbinding of names
This paper is concerned with a programming language construct for typed name binding that enforces -equivalence. It proves a new result about what operations on names can co-exist...
Andrew M. Pitts, Mark R. Shinwell
ENTCS
2008
142views more  ENTCS 2008»
13 years 7 months ago
An Open System Operational Semantics for an Object-Oriented and Component-Based Language
Object orientation and component-based development have both proven useful for the elaboration of open distributed systems. These paradigms are offered by the Creol language. Creo...
Jasmin Christian Blanchette, Olaf Owe
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
14 years 1 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
ENTCS
2007
128views more  ENTCS 2007»
13 years 7 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...