The heart of intersection type assignment: Normalisation proofs revisited
type: Item
instance of: scholarly article
title: The heart of intersection type assignment: Normalisation proofs revisited
zbMATH Open document ID: 1145.68014
author: Steffen Van Bakel
published in: Theoretical Computer Science
publication date: 2008-06-24T00:00:00Z
Mathematics Subject Classification ID: 68N18
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 5292219
zbMATH Keywords: intersection types
zbMATH Keywords: cut-elimination
zbMATH Keywords: strong normalisation
zbMATH Keywords: approximants
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.01.020
OpenAlex ID: W2074465205
cites work: Complete restrictions of the intersection type discipline
cites work: Intersection type assignment systems
cites work: Cut-elimination in the strict intersection type assignment system is strongly normalizing
cites work: Approximation and normalization results for typeable term rewriting systems
cites work: Normalization results for typeable rewrite systems
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: An extension of basic functionality theory for \(\lambda\)-calculus
cites work: Combinatory logic. With two sections by William Craig.
cites work: Q3994895
cites work: Principal type schemes for an extended type theory
cites work: Intensional interpretations of functionals of finite type I
cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
DOI: 10.1016/J.TCS.2008.01.020
description: scientific article; zbMATH DE number 5292219