This paper describes a mechanism by which an operating system kernel can determine with certainty that it is safe to execute a binary supplied by an untrusted source. The kernel rst de …
Z Shao - Proc. 1997 acm sigplan workshop on types in …, 1997 - Citeseer
The FLINT project at Yale aims to build a state-of-the-art systems environment for modern typesafe languages. One important component of the FLINT system is a high-performance …
L Augustsson - ACM SIGPLAN Notices, 1998 - dl.acm.org
Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, ie, the result type of a function may depend on the …
A thorough and accessible introduction to a range of key ideas in type systems for programming language. The study of type systems for programming languages now touches …
C Flanagan - Conference record of the 33rd ACM SIGPLAN-SIGACT …, 2006 - dl.acm.org
Traditional static type systems are very effective for verifying basic interface specifications, but are somewhat limited in the kinds specifications they support. Dynamically-checked …
Concurrent programming in ML | Guide books skip to main content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced …
GC Necula, P Lee - ACM SIGPLAN Notices, 1998 - dl.acm.org
This paper presents the design and implementation of a compiler that translates programs written in a type-safe subset of the C programming language into highly optimized DEC …
Haskell's popularity has driven the need for ever more expressive type system features, most of which threaten the decidability and practicality of Damas-Milner type inference. One such …
F Smith, D Walker, G Morrisett - European Symposium on Programming, 2000 - Springer
Linear type systems allow destructive operations such as object deallocation and imperative updates of functional data structures. These operations and others, such as the ability to …