Extending the type checker of Standard ML by polymorphic recursion (Q1275627): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified basic functionality in combinatory logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590039 / 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: Q3819992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the semi-unification problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035254 / 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: Q3340118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank

Latest revision as of 17:03, 28 May 2024

scientific article
Language Label Description Also known as
English
Extending the type checker of Standard ML by polymorphic recursion
scientific article

    Statements

    Extending the type checker of Standard ML by polymorphic recursion (English)
    0 references
    0 references
    0 references
    12 January 1999
    0 references
    Functional programming
    0 references
    Type inference
    0 references
    Polymorphic recursion
    0 references

    Identifiers