Subtyping recursion and parametric polymorphism in kernel Fun (Q1780453): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/j.ic.2004.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976571588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric interpretations of infinite trees and semantics of non deterministic recursive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling standard ML to Java bytecodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semantic basis for Quest / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of system \(F\) with subtyping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coherence of subsumption, minimum typing and type-checking in F ≤ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Type theories and object-oriented programmimg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive subtyping revealed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of kernel Fun subtype checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281471 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divergence of \(F_{\leq}\) type checking / 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: Q4288818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient recursive subtyping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded quantification is undecidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice-theoretical fixpoint theorem and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The subtyping problem for second-order types is undecidable. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:31, 10 June 2024

scientific article
Language Label Description Also known as
English
Subtyping recursion and parametric polymorphism in kernel Fun
scientific article

    Statements

    Subtyping recursion and parametric polymorphism in kernel Fun (English)
    0 references
    0 references
    0 references
    13 June 2005
    0 references
    Type theory and type systems
    0 references
    Subtyping
    0 references
    Recursive types
    0 references
    Kernel Fun
    0 references

    Identifiers