Substructural type system
Substructural type systems are a family of type systems analogous to substructural logics where one or more of the structural rules are absent or allowed under controlled circumstances. Such systems are useful for constraining access to system resources such as files, locks and memory by keeping track of changes of state that occur and preventing invalid states.
Different substructural type systems
Several type systems have emerged by discarding some of the structural rules exchange, weakening and contraction:
- Linear type systems (allow exchange, not weakening or contraction): Every variable is used exactly once.
- Affine type systems (allow exchange and weakening, not contraction): Every variable is used at most once.
- Relevant type systems (allow exchange and contraction, not weakening): Every variable is used at least once.
- Ordered type systems (discard exchange, contraction and weakening): Every variable is used exactly once in the order it was introduced.
Linear type systems
Linear type systems allow references but not aliases. To enforce this, a reference goes out of scope after appearing on the right-hand side of an assignment, thus ensuring that only one reference to any object exists at once. Note that passing a reference as an argument to a function is a form of assignment, as the function parameter will be assigned the value inside the function, and therefore such use of a reference also causes it to go out of scope.
A linear type system is similar to C++'s auto_ptr class, which behaves like a pointer but is invalidated by being set to null after use in an assignment. Although the linearity constraint is checked at compile time, dereferencing an invalidated auto_ptr causes undefined behavior at run-time.
The single-reference property makes linear type systems suitable as programming languages for quantum computation, as it reflects the no-cloning theorem of quantum states. From the category theory point of view, no-cloning is a statement that there is no diagonal functor which could duplicate states; similarly, from the combinator point of view, there is no K-combinator which can destroy states. From the lambda calculus point of view, a variable x can appear at most once in a term.
Linear type systems are the internal language of closed symmetric monoidal categories, much in the same way that simply typed lambda calculus is the language of Cartesian closed categories. More precisely, one may construct functors between the category of linear type systems and the category of closed symmetric monoidal categories.
Affine type systems
Affine types are a weaker version of linear types and correspond to affine logic; an affine resource can only be used once, while a linear one must be used once.
Relevant type system
Relevant types correspond to relevant logic which allows exchange and contraction but not weakening, which translates to every variable being used at least once.
Ordered type system
Ordered types correspond to noncommutative logic where exchange, contraction and weakening are discarded and can be used to model stack-based memory allocation (contrast with linear types which can be used to model heap-based memory allocation). Without the exchange property an object may only be used when at the top of the stack, after which it is popped off resulting in every variable being used exactly once in the order it was introduced.
The following programming languages support linear (or affine) types:
- Walker 2002, p. X.
- Walker 2002, p. 4.
- Walker 2002, p. 6.
- Walker 2002, p. 43.
- std::auto_ptr reference
- John c. Baez and Mike Stay, "Physics, Topology, Logic and Computation: A Rosetta Stone", (2009) ArXiv 0903.0340 in New Structures for Physics, ed. Bob Coecke, Lecture Notes in Physics vol. 813, Springer, Berlin, 2011, pp. 95-174.
- S. Ambler, "First order logic in symmetric monoidal closed categories", Ph.D. thesis, U. of Edinburgh, 1991.
- Walker 2002, pp. 30–31.