Intersection types for -trees

DOI10.1016/S0304-3975(00)00346-7MaRDI QIDQ5958291zbMATH OpenOpenAlexFDO

Authors Steffen Van Bakel, Franco Barbanera, Mariangiola Dezani-Ciancaglini, Fer-Jan De Vries

Publication date 3 March 2002

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00346-7

zbMATH Keywords

approximantsBöhm treesintersection types

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Intersection and singleton type assignment characterizing finite Böhm-trees
• scientific article; zbMATH DE number 2185718
• scientific article; zbMATH DE number 1361533
• Intersection types and lambda models
• Intersection type assignment systems

Cites work

• A filter lambda model and the completeness of type assignment
• A Filter Model for Concurrent \lambda-Calculus
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• Algebras and combinators
• An algebraic interpretation of the K-calculus; and an application of a labelled -calculus
• Characterization theorems for a filter lambda model
• Data Types as Lattices
• Discrimination by parallel observers: the algorithm.
• Full abstraction in the lazy lambda calculus
• scientific article; zbMATH DE number 3889502 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 3550683 (Why is no real title available?)
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• scientific article; zbMATH DE number 1497857 (Why is no real title available?)
• scientific article; zbMATH DE number 937379 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Infinitary lambda calculus
• Infinite \(\lambda\)-calculus and types
• Lambda-calculi for (strict) parallel functions
• Principal Type Schemes for the Strict Type Assignment System
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• The discriminating power of multiplicities in the \(\lambda\)-calculus
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The lazy lambda calculus in a concurrency scenario
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Type theories, normal forms, and \(D_{\infty}\)-lambda-models

Cited in

(10)

• Intersection and singleton type assignment characterizing finite Böhm-trees
• Intersection types and lambda models
• Relational graph models, Taylor expansion and extensionality
• scientific article; zbMATH DE number 2185718 (Why is no real title available?)
• scientific article; zbMATH DE number 1361533 (Why is no real title available?)
• scientific article; zbMATH DE number 2087543 (Why is no real title available?)
• The infinitary lambda calculus of the infinite eta Böhm trees
• Cut-elimination in the strict intersection type assignment system is strongly normalizing
• Extensional and non-extensional functions as processes
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca

This page was built for publication: Intersection types for \(\lambda\)-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5958291)