Skip Navigation

Journal of Logic and Computation 2000 10(4):493-526; doi:10.1093/logcom/10.4.493
© 2000 by Oxford University Press
This Article
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 (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Longo, G
Right arrow Articles by Soloviev, S
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Coherence and transitivity of subtyping as entailment

G LongoA, K MilstedA2 and S SolovievA3

A LIENS(CNRS) and DMI, Ecole Normale Supérieure, 45 rue d'Ulm, 75005 Paris, France E-mail: longo@dmi.ens.fr, A2 NET, France Télécom, 28 chemin du Vieux Chêne, BP 98, 38243 Meylan Cedex, France E-mail: kathleen.milsted@cnet.francetelecom.fr, A3 IRIT, Université de Toulouse-III, 118 route de Narbonne, 31062 Toulouse, France E-mail: soloviev@irit.fr

The relation of inclusion between types has been suggested by the practice of programming as it enriches the polymorphism of functional languages. We propose a simple (and linear) sequent calculus for subtyping as logical entailment. This allows us to derive a complete and coherent approach to subtyping from a few, logically meaningful sequents. In particular, transitivity and anti-symmetry will be derived from elementary logical principles.

Keywords: second-order logic, Gentzen sequent calculus, polymorphism, coercive subtyping, cut-elimination


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.