Intersection types for \(\lambda\)-trees (Q5958291): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full abstraction in the lazy lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal Type Schemes for the Strict Type Assignment System / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filter lambda model and the completeness of type assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4896520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite \(\lambda\)-calculus and types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda-calculi for (strict) parallel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discriminating power of multiplicities in the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type theories, normal forms, and \(D_{\infty}\)-lambda-models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Filter Model for Concurrent $\lambda$-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4499287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrimination by parallel observers: the algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras and combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinitary lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization theorems for a filter lambda model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lazy lambda calculus in a concurrency scenario / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(00)00346-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168041414 / rank
 
Normal rank

Latest revision as of 11:34, 30 July 2024

scientific article; zbMATH DE number 1715292
Language Label Description Also known as
English
Intersection types for \(\lambda\)-trees
scientific article; zbMATH DE number 1715292

    Statements

    Intersection types for \(\lambda\)-trees (English)
    0 references
    0 references
    0 references
    0 references
    3 March 2002
    0 references
    Böhm trees
    0 references
    approximants
    0 references
    intersection types
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers