Sciweavers

1096 search results - page 93 / 220
» Type inference for atomicity
Sort
View
LICS
1997
IEEE
14 years 1 months ago
Full Abstraction for Functional Languages with Control
traction for Functional Languages with Control James Laird LFCS, Department of Computer Science University of Edinburgh This paper considers the consequences of relaxing the brack...
James Laird
CSFW
1998
IEEE
14 years 23 days 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
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
13 years 7 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ICFP
2005
ACM
14 years 9 months ago
Simple, partial type-inference for System F based on type-containment
We explore partial type-inference for System F based on type-containment. We consider both cases of a purely functional semantics and a call-by-value stateful semantics. To enable...
Didier Rémy
FPCA
1989
14 years 1 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori