Sciweavers

163 search results - page 14 / 33
» Type Systems for Useless-Variable Elimination
Sort
View

Book
301views
15 years 5 months ago
Programming in Standard ML
"Standard ML is a type-safe programming language that embodies many innovative ideas in programming language design. It is a statically typed language, with an extensible type...
Robert Harper
IEEESP
2008
89views more  IEEESP 2008»
13 years 7 months ago
Virtual Machine Introspection: Observation or Interference?
hardware, eliminating an abstraction layer and often improving efficiency as a result. Examples of type 1 systems include VMware ESX,3 Xen (www. xensource.com/xen/xen/nfamily/virtu...
Kara L. Nance, Matt Bishop, Brian Hay
ESOP
2004
Springer
13 years 11 months ago
ML-Like Inference for Classifiers
Environment classifiers were proposed as a new approach to typing multi-stage languages. Safety was established in the simply-typed and let-polymorphic settings. While the motivati...
Cristiano Calcagno, Eugenio Moggi, Walid Taha
CSFW
1998
IEEE
13 years 11 months ago
Probabilistic Noninterference in a Concurrent Language
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
Dennis M. Volpano, Geoffrey Smith
RTA
2010
Springer
13 years 11 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot