Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Under consideration of Math. Struct. in Comp. Science Structural subtyping for inductive types
 

Summary: Under consideration of Math. Struct. in Comp. Science
Structural subtyping for inductive types
with functorial equality rules
Zhaohui Luo and Robin Adams
Department of Computer Science
Royal Holloway, University of London
Egham, Surrey TW20 0EX, U.K.
Received February 27, 2006 and Revised December 21, 2006
Abstract
Subtyping for inductive types in dependent type theories is studied in the framework of
coercive subtyping. General structural subtyping rules for parameterised inductive types
are formulated based on the notion of inductive schemata. Certain extensional equality
rules play an important role in proving some of the crucial properties of the type system
with these subtyping rules. In particular, it is shown that the structural subtyping rules
are coherent and that transitivity is admissible in the presence of the functorial rules of
computational equality.
1. Introduction
Coercive subtyping [Luo97, Luo99] is a general framework for subtyping and abbreviation
in dependent type theories. In particular, it incorporates subtyping for inductive types.
In this paper, structural subtyping for inductive types is studied in the framework of

  

Source: Adams, Robin - Department of Computer Science, Royal Holloway, University of London

 

Collections: Computer Technologies and Information Sciences