Intersection and singleton type assignment characterizing finite Böhm-trees

Authors:
Toshihiko Kurata
Affiliations:
Department of Mathematics, Tokyo Metropolitan University, Minami-Osawa, Hachioji-shi, Tokyo, Japan
Venue:
Information and Computation
Year:
2002

Citing 6
Cited 0

Proofs and types

Proofs and types
Type systems for programming languages

Handbook of theoretical computer science (vol. B)
Complete restrictions of the intersection type discipline

Theoretical Computer Science
Singleton, union, and intersection types for program extraction

Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
A Type Theoretical View of Böhm-Trees

TLCA '97 Proceedings of the Third International Conference on Typed Lambda Calculi and Applications
Subtyping with Singleton Types

CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

Intersection types and type constants representing unsolvability and singleton sets of λ-terms are incorporated into the Curry version of a simple type assignment system. Two restricted forms of typability in the system turn out to be equivalent to finiteness of Böhm-trees.