Proofs of a set of hybrid let-polymorphic type inference algorithms (Q1762932): Difference between revisions

From MaRDI portal
Changed an 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: Compositional explanation of types and algorithmic debugging of type errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explaining type inference / 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: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2763643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type inference with partial types / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf03037279 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980574179 / rank
 
Normal rank

Latest revision as of 08:36, 30 July 2024

scientific article
Language Label Description Also known as
English
Proofs of a set of hybrid let-polymorphic type inference algorithms
scientific article

    Statements

    Proofs of a set of hybrid let-polymorphic type inference algorithms (English)
    0 references
    0 references
    0 references
    0 references
    11 February 2005
    0 references
    Type System
    0 references
    Type Inference Algorithm
    0 references
    Let-Polymorphism
    0 references
    0 references
    0 references

    Identifiers