Substructural type system

Known as: Substructural type systems, Ordered type system, Ordered type 
Substructural type systems are a family of type systems analogous to substructural logics where one or more of the structural rules are absent or… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
0102019772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The deep connection between session-typed concurrency and linear logic is embodied in the language SILL that integrates… (More)
Is this relevant?
2014
2014
Linear and substructural types are powerful tools, but adding them to standard functional programming languages often means… (More)
  • figure 7
  • figure 11
  • table 1
Is this relevant?
2012
2012
Many substructural type systems have been proposed for controlling access to shared state in higher-order languages. Central to… (More)
  • figure 1
  • figure 5
  • figure 4
  • figure 3
  • figure 6
Is this relevant?
2012
2012
Substructural logics remove from classical logic rules for reordering, duplication, or dropping of assumptions. Because… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.9
  • figure 3.12
  • figure 4.1
Is this relevant?
2007
2007
We propose type systems that abstractly interpret small-step rather than big-step operational semantics. We treat an expression… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A type system with linearity is useful for checking software protocols andresource management at compile time. Linearity provides… (More)
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Linear type systems permit programmers to deallocate or explicitly recycle memory, but are severely restricted by the fact that… (More)
  • figure 1
  • figure 2
  • figure 8
  • figure 9
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Linear types (types of values that can be used just once) have been drawing a great deal of attention because they are useful for… (More)
  • figure 3
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We propose a linear type system with recursion operators for inductive datatypes which ensures that all definable functions are… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The economy and flexibility of the pi-calculus make it an attractive object of theoretical study and a clean basis for concurrent… (More)
Is this relevant?