Polarized Subtyping for Sized Types | Zendy

Andreas Abel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Polarized Subtyping for Sized Types

Author(s) -

Andreas Abel

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-34166-8

DOI - 10.1007/11753728_39

Subject(s) - subtyping , coinduction , normalization (sociology) , computer science , modulo , bounded function , programming language , completeness (order theory) , type theory , theoretical computer science , type (biology) , calculus (dental) , algorithm , discrete mathematics , mathematical proof , mathematics , medicine , mathematical analysis , geometry , dentistry , sociology , anthropology , ecology , biology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research