Publication detail

A Calculus of Coercive Subtyping

ŠKARVADA, L. PETERKA, O. RYŠAVÝ, O. KOLÁŘ, D.

Original Title

A Calculus of Coercive Subtyping

English Title

A Calculus of Coercive Subtyping

Type

conference paper

Language

en

Original Abstract

Our work that stems, in particular, from the research done by Aspinall and Compagnoni, and Luo attempts to provide a framework for systematical studying coercive subtyping in dependent type systems. Contrary to Aspinall and Compagnoni we define subtyping based on coercions instead of allowing term overloading. Contrary to Luo we implemented coercive subtyping as direct extension of \lambda P type system instead of introducing definitional mechanism, which is more powerfull but leads to more complicated presentation of a system.

English abstract

Our work that stems, in particular, from the research done by Aspinall and Compagnoni, and Luo attempts to provide a framework for systematical studying coercive subtyping in dependent type systems. Contrary to Aspinall and Compagnoni we define subtyping based on coercions instead of allowing term overloading. Contrary to Luo we implemented coercive subtyping as direct extension of \lambda P type system instead of introducing definitional mechanism, which is more powerfull but leads to more complicated presentation of a system.

Keywords

type theory, lambda calculus,coercive subtyping

Released

18.11.2009

Publisher

Seton Hall University

Location

South Orange

Pages from

182

Pages to

192

Pages count

11

URL

Documents

BibTex


@inproceedings{BUT34397,
  author="Libor {Škarvada} and Ondřej {Peterka} and Ondřej {Ryšavý} and Dušan {Kolář}",
  title="A Calculus of Coercive Subtyping",
  annote="Our work that stems, in particular, from the research done by Aspinall and
Compagnoni, and Luo attempts to provide a framework for systematical studying
coercive subtyping in dependent type systems. Contrary to Aspinall and Compagnoni
we define subtyping based on coercions instead of allowing term overloading.
Contrary to Luo we implemented coercive subtyping as direct extension of \lambda
P type system instead of introducing definitional mechanism, which is more
powerfull but leads to more complicated presentation of a system.",
  address="Seton Hall University",
  booktitle="Draft Proceedings of the 21st International Symposium on Implementation and Application of Functional Languages",
  chapter="34397",
  edition="SHU-TR-CS-2009-09-01",
  howpublished="print",
  institution="Seton Hall University",
  year="2009",
  month="november",
  pages="182--192",
  publisher="Seton Hall University",
  type="conference paper"
}