Sciweavers

640 search results - page 82 / 128
» Logical types for untyped languages
Sort
View
LREC
2008
125views Education» more  LREC 2008»
13 years 10 months ago
Towards Formal Interpretation of Semantic Annotation
In this paper we present a novel approach to the incremental incorporation of semantic information in natural language processing which does not fall victim to the notorious probl...
Harry Bunt, Chwhynny Overbeeke
CSFW
2011
IEEE
12 years 9 months ago
Modular Protections against Non-control Data Attacks
—This paper introduces YARRA, a conservative extension to C to protect applications from non-control data attacks. YARRA programmers specify their data integrity requirements by ...
Cole Schlesinger, Karthik Pattabiraman, Nikhil Swa...
ICFP
2005
ACM
14 years 9 months ago
Monadic augment and generalised short cut fusion
Monads are commonplace programming devices that are used to uniformly structure computations with effects such as state, exceptions, and I/O. This paper further develops the monad...
Neil Ghani, Patricia Johann, Tarmo Uustalu, Varmo ...
PLDI
2003
ACM
14 years 2 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
ICFP
2002
ACM
14 years 9 months ago
A compiled implementation of strong reduction
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
Benjamin Grégoire, Xavier Leroy