Polarized subtyping for sized types

Authors:
Andreas Abel
Affiliations:
Department of Computer Science, University of Munich, München, Germany
Venue:
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Year:
2006

Citing 17
Cited 5

Proofs and types

Proofs and types
An algorithm for testing conversion in type theory

Logical frameworks
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Higher-order subtyping

Theoretical Computer Science
From fast exponentiation to square matrices: an adventure in types

Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
Types and programming languages

Types and programming languages
Typed Operational Semantics

TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Soundness of the Logical Framework for Its Typed Operational Semantics

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Monadic Presentations of Lambda Terms Using Generalized Inductive Types

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Anti-Symmetry of Higher-Order Subtyping

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Typed operational semantics for higher-order subtyping

Information and Computation
Type-based termination of recursive definitions

Mathematical Structures in Computer Science
Generalizing generalized tries

Journal of Functional Programming
de Bruijn notation as a nested datatype

Journal of Functional Programming
On equivalence and canonical forms in the LF type theory

ACM Transactions on Computational Logic (TOCL)
Iteration and coiteration schemes for higher-order and nested datatypes

Theoretical Computer Science - Foundations of software science and computation structures
Justifying algorithms for βη-conversion

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Syntactic Metatheory of Higher-Order Subtyping

CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Strong normalization and equi-(co)inductive types

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Mixed inductive/coinductive types and strong normalization

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Semi-continuous sized types and termination

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Implementing a normalizer using sized heterogeneous types

MSFP'06 Proceedings of the 2006 international conference on Mathematically Structured Functional Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm for deciding polarized higher-order subtyping without bounded quantification. Constructors are identified not only modulo β, but also η. We give a direct proof of completeness, without constructing a model or establishing a strong normalization theorem. Inductive and coinductive types are enriched with a notion of size and the subtyping calculus is extended to account for the arising inclusions between the sized types.