Type inference with recursive types: Syntax and semantics (Q756435): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LCF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ML / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0890-5401(91)90020-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2079958455 / 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: The solutions of two star-height problems for regular trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness of type assignment in continuous lambda models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental properties of infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4772711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified basic functionality in combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatory logic. With two sections by William Craig. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebras and combinators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edinburgh LCF. A mechanized logic of computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Principal Type-Scheme of an Object in Combinatory Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness theorem for typing lambda-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / 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: An ideal model for recursive polymorphic types / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymorphic type inference and containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Proving Limiting Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / 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 / cites work
 
Property / cites work: Q3787979 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:06, 21 June 2024

scientific article
Language Label Description Also known as
English
Type inference with recursive types: Syntax and semantics
scientific article

    Statements

    Type inference with recursive types: Syntax and semantics (English)
    0 references
    0 references
    0 references
    1991
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    functional programming languages
    0 references
    recursive types
    0 references
    infinite (regular) type expressions
    0 references
    interpretation
    0 references
    completeness theorem
    0 references
    type inference system
    0 references
    0 references
    0 references
    0 references