Completeness of intersection and union type assignment systems for call-by-value λ-models

Authors:
Hajime Ishihara;Toshihiko Kurata
Affiliations:
Japan Advanced Institute of Science and Technology, Ishikawa, Japan;Tokyo Metropolitan Univ., Tokyo, Japan
Venue:
Theoretical Computer Science - Special issue on theories of types and proofs
Year:
2002

Citing 11
Cited 3

Introduction to combinators and &lgr;-calculus

Introduction to combinators and &lgr;-calculus
An ideal model for recursive polymorphic types

Information and Control
Polymorphic type inference and containment

Information and Computation - Semantics of Data Types
Operational, denotational and logical descriptions: a case study

Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
Set-theoretical and other elementary models of the &lgr;-calculus

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Singleton, union, and intersection types for program extraction

Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
A semantics for static type inference

Information and Computation - Special conference issue: international conference on theoretical aspects of computer software
Intersection and union types: syntax and semantics

Information and Computation
Basic proof theory

Basic proof theory
Basic simple type theory

Basic simple type theory
The simple semantics for Coppe-Dezani-Sallé types

Proceedings of the 5th Colloquium on International Symposium on Programming

On the Values of Reducibility Candidates

TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Characterizing convergent terms in object calculi via intersection types

TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Intersection Types with Subtyping by Means of Cut Elimination

Fundamenta Informaticae - Intersection Types and Related Systems ITRS

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a version of intersection and union-type assignmentsystem, union elimination rule of which is allowed only whensubject of its major premise is a value of call-by-valueë-calculus. The system is shown to be sound and complete undersome abstract notion of membership relation defined over simplesemantics for call-by-value β-models, and to be invariantunder call-by-value β-conversion of subjects. We prove it byconstructing a filter call-by-value &lgr-model. Copyright 2002Elsevier Science B.V.