Sciweavers

441 search results - page 27 / 89
» The logical approach to stack typing
Sort
View
ENGL
2007
144views more  ENGL 2007»
14 years 9 months ago
Constructive Analysis of Intensional Phenomena in Natural Language
Abstract— Chierchia [2, 3, 4], pointed out the inadequacy of Montague’s approach in the analysis of certain natural language constructions, such as nominalization and propositi...
Rogelio Davila, Leonardo Soto, Nahitt H. Padilla
173
Voted
POPL
2007
ACM
15 years 9 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
109
Voted
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 2 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...
91
Voted
PLDI
2010
ACM
15 years 2 months ago
Mixing type checking and symbolic execution
Static analysis designers must carefully balance precision and efficiency. In our experience, many static analysis tools are built around an elegant, core algorithm, but that alg...
Yit Phang Khoo, Bor-Yuh Evan Chang, Jeffrey S. Fos...
70
Voted
ERLANG
2008
ACM
14 years 11 months ago
Gradual typing of erlang programs: a wrangler experience
Currently most Erlang programs contain no or very little type information. This sometimes makes them unreliable, hard to use, and difficult to understand and maintain. In this pap...
Konstantinos F. Sagonas, Daniel Luna