Math 2.0

Computer science Type theory Concept

Linear type system

Builds on Type systemLinear logic

Summary

A linear type system is a type system in which each variable must be used exactly once. It is the type-theoretic side of linear logic. It drops the structural rules of weakening, which allows a variable to be ignored, and of contraction, which allows it to be used twice. Values of linear type behave like resources, such as a file handle or a block of memory, that can be neither copied nor lost. Related substructural systems are affine types, where each variable is used at most once, and relevant types, where it is used at least once. Rust's ownership types are close to affine types.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Linear logic, concept, no evidence levelLinear logicconceptType system, concept, no evidence levelType systemconceptLinear type system, concept, no evidence levelLinear type systemconcept
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Linear logic concept
  2. Type system concept
  3. Linear type system concept

Further reading

  1. Web https://en.wikipedia.org/wiki/Substructural_type_system
About this page
TagDJGYZTS0YC
URIm2://DJGYZTS0YC
Kindconcept
WritingW0 stub
MSC68N15, 03B47, 68N18
SpecializesType system
UsesType system, Linear logic
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions