Completeness of type assignment systems with intersection, union, and type quantifiers
type: Item
instance of: scholarly article
title: Completeness of type assignment systems with intersection, union, and type quantifiers
zbMATH Open document ID: 0984.68027
DOI: 10.1016/S0304-3975(00)00356-X
author: Hirofumi Yokouchi
published in: Theoretical Computer Science
publication date: 2002-03-03T00:00:00Z
Mathematics Subject Classification ID: 68N18
zbMATH DE Number: 1715302
zbMATH Keywords: lambda calculus
zbMATH Keywords: type systems
zbMATH Keywords: sequent calculus
zbMATH Keywords: cut-elimination
zbMATH Keywords: Kripke models
MaRDI profile type: MaRDI publication profile
cites work: Q4035227
cites work: Intersection and union types: Syntax and semantics
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: A filter lambda model and the completeness of type assignment
cites work: Mathematical thought. An introduction to the philosophy of mathematics
cites work: Combining type disciplines
cites work: Functional Characters of Solvable Terms
cites work: Completeness in the theory of types
cites work: Q3659755
cites work: The completeness theorem for typing lambda-terms
cites work: Curry's type-rules are complete with respect to the F-semantics too
cites work: Q4722037
cites work: Typing and computational properties of lambda expressions
cites work: An ideal model for recursive polymorphic types
cites work: Polymorphic type inference and containment
cites work: Kripke-style models for typed lambda calculus
cites work: Hauptsatz for higher order logic
cites work: A proof of cut-elimination theorem in simple type-theory
cites work: Proof theory
cites work: Constructivism in mathematics. An introduction. Volume I
cites work: \(F\)-semantics for type assignment systems
cites work: Q4936136
Recommended article: Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
Recommended article: Intersection and union types: Syntax and semantics
Recommended article: Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\)
Recommended article: Completeness and Soundness Results for 𝒳 with Intersection and Union Types
Recommended article: \(F\)-semantics for type assignment systems
description: scientific article; zbMATH DE number 1715302