Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Higher-Order Subtyping, Revisited Syntactic Completeness Proofs for Algorithmic Judgements
 

Summary: Higher-Order Subtyping, Revisited
Syntactic Completeness Proofs for Algorithmic Judgements
Andreas Abel
TYPES Workshop, April 21, 2006
Contents
1. Subtyping for type constructors (F
)
2. Proof Technique for Metatheory
∑ Elementary (no model)
∑ Works for weak theories: STL, LF
1 Higher-Order Subtyping
Subtyping for Collections
∑ When a Float is expected, an Int is acceptable.
Int Float
∑ Read-only collections: a list of Ints passes for a list of Floats.
Int Float
List Int List Float
∑ Mutable collections: cannot store a Float into an Int cell.
not
Int Float

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universit√§t M√ľnchen

 

Collections: Computer Technologies and Information Sciences