Family of type systems based on substructural logic
Type systems
General concepts
Type safety
Strong vs. weak typing
Major categories
Static vs. dynamic
Manifest vs. inferred
Nominal vs. structural
Duck typing
Minor categories
Abstract
Dependent
Flow-sensitive
Gradual
Intersection
Latent
Refinement
Substructural
Unique
Session
v
t
e
Substructural type systems are a family of type systems analogous to substructural logics where one or more of the structural rules are absent or only allowed under controlled circumstances. Such systems can constrain access to system resources such as files, locks, and memory by keeping track of changes of state and prohibiting invalid states.[1]: 4
^Walker, David (2002). "Substructural Type Systems". In Pierce, Benjamin C. (ed.). Advanced Topics in Types and Programming Languages(PDF). MIT Press. pp. 3–43. ISBN 0-262-16228-8.
and 27 Related for: Substructural type system information
proposed the term "substructural logics", which is now in use today. Substructuraltypesystem Residuated lattice F. Paoli (2002), Substructural Logics: A Primer...
of the types. Nominal systems are used to determine if types are equivalent, as well as if a type is a subtype of another. Nominal typesystems contrast...
In computer programming, a typesystem is a logical system comprising a set of rules that assigns a property called a type (for example, integer, floating...
only upon 'reduced' forms of its arguments, such as Walther recursion, substructural recursion, or "strongly normalizing" as proven by abstract interpretation...
The type III secretion system (T3SS or TTSS) is one of the bacterial secretion systems used by bacteria to secrete their effector proteins into the host's...
under static enforcement. In the context of static (compile-time) typesystems, type safety usually involves (among other things) a guarantee that the...
procedure revisited: notes on Direct Logic. In Linear Logic and its Implementation. Relevant logic Affine typesystem, a substructuraltypesystem v t e...
Gradual typing is a typesystem in which some variables and expressions may be given types and the correctness of the typing is checked at compile time...
colloquially classified is whether the language's typesystem makes it strongly typed or weakly typed (loosely typed). However, there is no precise technical definition...
structural typing. Structural typing is a static typingsystem that determines type compatibility and equivalence by a type's structure, whereas duck typing is...
dependent type is a type whose definition depends on a value. It is an overlapping feature of type theory and typesystems. In intuitionistic type theory...
abstract type (also known as existential types) is a type in a nominative typesystem that cannot be instantiated directly; by contrast, a concrete type can...
for ML, which presents a typesystem for a subset of Standard ML. The typesystem "preserves the decidability of ML's type inference" whilst still "allowing...
Linear logic is a substructural logic proposed by French logician Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the...
expected order and of the expected type. Session typesystems have been adapted for both channel and actor systems. Session types are used to ensure desirable...
programming, latent typing refers to a typesystem where types are associated with values and not variables. An example latently typed language is Scheme...
integer, respectively. The typesystem rejects, at compile-time, such fallacies as trying to add s and x. Since C23, type inference can be used in C with...
languages and mathematical typesystems, but also natural languages in some branches of computer science and linguistics. Types in a most general view can...
implications to be relevantly related. They may be viewed as a family of substructural or modal logics. It is generally, but not universally, called relevant...
society, and its constituent substructures, qualify as complex sociotechnical systems. The term sociotechnical systems was coined by Eric Trist, Ken...
non-uniqueness modalities, but can then also be unified in a single typesystem. Linear type Linear logic Haller, P.; Odersky, M. (2010), "Capabilities for...
signature of each substructure. The definitions of type components are optional; type components whose definitions are hidden are abstract types. For example...