Sciweavers

709 search results - page 54 / 142
» Type Checking in XOBE
Sort
View
APLAS
2009
ACM
14 years 3 months ago
On the Decidability of Subtyping with Bounded Existential Types
Bounded existential types are a powerful language feature ling partial data abstraction and information hiding. However, existentials do not mingle well with subtyping as found in ...
Stefan Wehr, Peter Thiemann
APLAS
2000
ACM
14 years 1 months ago
A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
Oukseh Lee, Kwangkeun Yi
ICFP
2003
ACM
14 years 8 months ago
An effective theory of type refinements
We develop an explicit two level system that allows programmers to reason about the behavior of effectful programs. The first level is an ordinary ML-style type system, which conf...
Yitzhak Mandelbaum, David Walker, Robert Harper
FOAL
2009
ACM
14 years 3 months ago
A type system for functional traversal-based aspects
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
Bryan Chadwick, Karl J. Lieberherr
CC
2003
Springer
102views System Software» more  CC 2003»
14 years 2 months ago
Precision in Practice: A Type-Preserving Java Compiler
Popular mobile code architectures (Java and .NET) include verifiers to check for memory safety and other security properties. Since their formats are relatively high level, suppor...
Christopher League, Zhong Shao, Valery Trifonov