Quasi-Linear Types

Quasi-Linear Types (1999)

by Naoki Kobayashi

Citations:

54 - 5 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Quasi-Linear Types	user correction - Legacy Corrections
AUTHOR NAME	Naoki Kobayashi	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Information Science, University of Tokyo	SVM HeaderParse 0.2
AUTHOR ADDR	7-3-1 Hongo,Bunkyo-ku, Tokyo 113-0033, Japan	SVM HeaderParse 0.1
ABSTRACT	Linear types (types of values that can be used just once) have been drawing a great deal of attention because they are useful for memory management, in-place update of data structures, etc.: an obvious advantage is that a value of a linear type can be immediately deallocated after being used. However, the linear types have not been applied so widely in practice, probably because linear values (values of linear types) in the traditional sense do not so often appear in actual programs. In order to increase the applicability of linear types, we relax the condition of linearity by extending the types with information on an evaluation order and simple dataflow information. The extended type system, called a quasi-linear type system, is formalized and its correctness is proved. We have implemented a prototype type inference system for the core-ML that can automatically find out which value is linear in the relaxed sense. Promising results were obtained from preliminary experiments with the p...	user correction - Legacy Corrections
YEAR	1999	user correction - Legacy Corrections
CITATIONS	18 found	ParsCit 1.0