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

  

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

 

Collections: Computer Technologies and Information Sciences