A logic of subtyping

Authors:
G. Loop;K. Milsted;S. Soloviev
Affiliations:
-;-;-
Venue:
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Year:
1995

Citing 0
Cited 8

Subtyping dependent types

Theoretical Computer Science
Coercive subtyping for the calculus of constructions

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Products and polymorphic subtypes

Fundamenta Informaticae
The subtyping problem for second-order types is undecidable

Information and Computation
The Subtyping Problem for Second-Order Types is Undecidable

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Subtyping Dependent Types

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Weak transitivity in coercive subtyping

TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
Products and Polymorphic Subtypes

Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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) calculus of sequents for subtyping as logical entailment. This allows to derive a complete and coherent approach to subtyping from a few, logically meaningful, sequents. In particular, transitivity and anti-symmetry are derived from elementary logical principles, which stresses the power of sequents and Gentzen-style proof methods. Indeed, proof techniques based on cut-elimination are at the core of our results.