Termination of system \(F\)-bounded: A complete proof (Q1383151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1006/inco.1997.2662 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A paradigmatic object-oriented programming language: Design, static typing and semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modest model of records, inheritance, and bounded quantification / 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: Decidability and confluence of \(\beta\eta\text{top}_ \leqslant\) reduction in \({\mathbb{F}}_ \leqslant\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of strong normalization for \(F_ 2\), \(F_ \omega\), and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple type-theoretic foundations for object-oriented programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/INCO.1997.2662 / rank
 
Normal rank

Latest revision as of 19:10, 10 December 2024

scientific article
Language Label Description Also known as
English
Termination of system \(F\)-bounded: A complete proof
scientific article

    Statements

    Identifiers