Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...
We study the type checking and type inference problems for intuitionistic linear logic: given a System F typed λ-term, (i) for an alleged linear logic type, determine whether the...
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
A new approach to Thai font type recognition that is presented in this paper is based on linear interpolation analysis of the character contour. The algorithm can perform effectiv...
Abstract— The problem of exact null-controllability is considered for a wide class of linear neutral type systems with distributed delay. The main tool of the analysis is the app...