Skip Navigation

Journal of Logic and Computation 2004 14(3):405-427; doi:10.1093/logcom/14.3.405
© 2004 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chen, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Soundness of Coercion in the Calculus of Constructions

Gang Chen

Computer Science Department, Boston University, Boston, MA 02215, USA. E-mail: gangchen5{at}aol.com

A coercive subtyping system for the Calculus of Constructions is presented. The proposed system {lambda}C≤co is obtained essentially by adding coercions and {eta}-conversion to {lambda}C≤, which is a subtyping extension to the Calculus of Constructions without coercions. We proved that a coercion c:A ≤ B is semantically sound. That is, (1) c is a term of type A -> B; (2) c behaves like an identity function. This development follows the spirit of semantical interpretation of subtyping.

Keywords: Subtyping, coercion, calculus of constructions, proof reuse

Received 4 February 2003.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.