Now showing items 1-4 of 4
A Practical Soft Type System for Scheme
Soft type systems provide the benefits of static type checking for dynamically typed languages without rejecting untypable programs. A soft type checker infers types for variables and expressions and inserts explicit ...
Polymorphism for Imperative Languages without Imperative Types
The simple and elegant Hindley/Milner polymorphic type discipline is the basis of the type system of Standard ML, but ML's imperative features are a blight on this otherwise clean landscape. Polymorphism and imperative ...
An Optimizing Fortran D Compiler for MIMD Distributed-Memory Machines
Massively parallel MIMD distributed-memory machines can provide enormous computational power; however, the difficulty of developing parallel programs for these machines has limited their use. Our thesis is that an advanced ...
Manetho: Fault Tolerance in Distributed Systems Using Rollback-Recovery and Process Replication
This dissertation presents a new protocol that allows rollback-recovery and process replication to co-exist in a distributed system. The protocol relies on a novel data structure called the antecedence graph, which tracks ...