Theoretical Computer Science
The C programming language
Is there a use for linear logic?
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation
Linear logic programming with an ordered context
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
On regions and linear types (extended abstract)
Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Flow-sensitive type qualifiers
PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Ordered linear logic and applications
Ordered linear logic and applications
An effective theory of type refinements
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
| Hi-index | 0.00 |
Substructural type systems are designed from the insight inspired by the development of linear and substructural logics. Substructural type systems promise to control the usage of computational resources statically, thus detect more program errors at an early stage than traditional type systems do. In the past decade, substructural type systems have been deployed in the design of novel programming languages, such as Vault, etc. This paper presents a general typing theory for substructural type system. First, we define a universal semantic framework for substructural types by interpreting them as characteristic intervals composed of type qualifiers. Based on this framework, we present the design of a substructural calculus 驴SL with subtyping relations. After giving syntax, typing rules and operational semantics for 驴SL, we prove the type safety theorem. The new calculus 驴SL can guarantee many more safety invariants than traditional lambda calculus, which is demonstrated by showing that the 驴SL calculus can serve as an idealized type intermediate language, and defining a type-preserving translation from ordinary typed lambda calculus into 驴SL.