Intersection types for \(\lambda\)-trees
From MaRDI portal
Publication:5958291
DOI10.1016/S0304-3975(00)00346-7zbMath0984.68033OpenAlexW2168041414MaRDI QIDQ5958291
Franco Barbanera, Steffen van Bakel, Fer-Jan de Vries, Mariangiola Dezani-Ciancaglini
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
Related Items (4)
Relational graph models, Taylor expansion and extensionality ⋮ Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca ⋮ Cut-elimination in the strict intersection type assignment system is strongly normalizing ⋮ The infinitary lambda calculus of the infinite eta Böhm trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models
- Algebras and combinators
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Full abstraction in the lazy lambda calculus
- Infinite \(\lambda\)-calculus and types
- Lambda-calculi for (strict) parallel functions
- The lazy lambda calculus in a concurrency scenario
- Infinitary lambda calculus
- Discrimination by parallel observers: the algorithm.
- The discriminating power of multiplicities in the \(\lambda\)-calculus
- A filter lambda model and the completeness of type assignment
- Characterization theorems for a filter lambda model
- A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
- Data Types as Lattices
- The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
- A Filter Model for Concurrent $\lambda$-Calculus
- Principal Type Schemes for the Strict Type Assignment System
This page was built for publication: Intersection types for \(\lambda\)-trees
