TL;DR: A type inference algorithm for a type system with selftype, recursive types, and subtyping is presented, and it is demonstrated that, for the language TOOPLE, type checking is decidable.
Abstract: The metavariable self is fundamental in object-oriented languages. Typing self in the presence of inheritance has been studied by Abadi and Cardelli, Bruce, and others. A key concept in these developments is the notion of selftype, which enables flexible type annotations that are impossible with recursive types and subtyping. Bruce et al. demonstrated that, for the language TOOPLE, type checking is decidable. Open until now is the problem of type inference with selftype. In this paper we present a type inference algorithm for a type system with selftype, recursive types, and subtyping. The example language is the object calculus of Abadi and Cardelli, and the type inference algorithm runs in nondeterministic polynomial time.
TL;DR: An efficient LFG parser implementation of Indian languages in general and Bangla in particular has been discussed and a "delayed" syntactic encoding formalism has been proposed.
Abstract: An efficient LFG parser implementation of Indian languages in general and Bangla in particular has been discussed. It has been shown that the classical technique of nonconfigurational syntactic encoding principles lead to too many disjunctive constraints to be satisfied by the parser. Noting that most of the disjunctions do not exist if an a priori knowledge of the verb is available, a "delayed" syntactic encoding formalism has been proposed. The points of syntactic encoding of noun phrases have been treated a "forward references" that are to be temporarily maintained in a "symbol table" for later precipitation. The proposed solution has two parts. The first part deals with identification of forward reference points, which is done by introducing a new metavariable and augmenting the scope of the Locate operator. The second part deals with precipitation of forward references through special schemata called m-structure schemata projected by the verb. An extension of the solution to one type of Bangla complex sentences has also been proposed (in the Appendix). Implementation notes based on object-oriented programming principles have been provided.
TL;DR: The paper develops a mathematical theory in the spirit of categorical algebra that provides a model theory for second-order and dependently-sorted syntax that embodies notions such as -equivalence, variable binding, capture-avoiding simultaneous substitution, term metavariable, meta-substitution, mono and multi sorting, and sort dependency.
Abstract: The paper develops a mathematical theory in the spirit of categorical algebra that provides a model theory for second-order and dependently-sorted syntax. The theory embodies notions such as -equivalence, variable binding, capture-avoiding simultaneous substitution, term metavariable, meta-substitution, mono and multi sorting, and sort dependency. As a matter of illustration, a model is used to extract a second-order syntactic theory, which is thus guaranteed to be correct by construction.