Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleJanuary 2001
Subtyping arithmetical types
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 276–289https://doi.org/10.1145/360204.360232We consider the type system formed by a finite set of primitive types such as integer, character, real, etc., and three type construction operators: (i) Cartesian product, (ii) disjoint sum, and (iii) recursive type definitions. Type equivalence is ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Type-indexed rows
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 261–275https://doi.org/10.1145/360204.360230Record calculi use labels to distinguish between the elements of products and sums. This paper presents a novel variation, type-indexed rows, in which labels are discarded and elements are indexed by their type alone. The calculus, λTIR, can ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Typing a multi-language intermediate code
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 248–260https://doi.org/10.1145/360204.360228The Microsoft .NET Framework is a new computing architecture designed to support a variety of distributed applications and web-based services. .NET software components are typically distributed in an object-oriented intermediate language, Microsoft IL, ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Secure safe ambients
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 222–235https://doi.org/10.1145/360204.360223Secure Safe Ambients (SSA) are a typed variant of Safe Ambients [9], whose type system allows behavioral invariants of ambients to be expressed and verified. The most significant aspect of the type system is its ability to capture both explicit and ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Type-preserving garbage collectors
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 166–178https://doi.org/10.1145/360204.360218By combining existing type systems with standard type-based compilation techniques, we describe how to write strongly typed programs that include a function that acts as a t racing garbage collector for the program. Since the garbage collector is an ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Oracle-based checking of untrusted software
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 142–154https://doi.org/10.1145/360204.360216We present a variant of Proof-Carrying Code (PCC) in which the trusted inference rules are represented as a higherorder logic program, the proof checker is replaced by a nondeterministic higher-order logic interpreter and the proof by an oracle ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Type-base flow analysis: from polymorphic subtyping to CFL-reachability
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 54–66https://doi.org/10.1145/360204.360208We present a novel approach to scalable implementation of type-based flow analysis with polymorphic subtyping. Using a new presentation of polymorphic subytping with instantiation constraints, we are able to apply context-free language (CFL) ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Colored local type inference
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 41–53https://doi.org/10.1145/360204.360207We present a type system for a language based on F≤, which allows certain type annotations to be elided in actual programs. Local type inference determines types by a combination of type propagation and local constraint solving, rather than by global ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001 - ArticleJanuary 2001
Verifying safety properties of concurrent Java programs using 3-valued logic
POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languagesJanuary 2001, Pages 27–40https://doi.org/10.1145/360204.360206We provide a parametric framework for verifying safety properties of concurrent Java programs. The framework combines thread-scheduling information with information about the shape of the heap. This leads to error-detection algorithms that are more ...
Also Published in:
ACM SIGPLAN Notices: Volume 36 Issue 3, March 2001