Coercive subtyping in lambda-free logical frameworks
Paper i proceeding, 2009

We show how coercive subtyping may be added to a lambda-free logical framework, by constructing the logical framework TF<, an extension of the lambda-free logical framework TF with coercive subtyping. Instead of coercive application, TF< makes use of a typecasting operation. We develop the metatheory of the resulting framework, including providing some general conditions under which typecasting in an object theory with coercive subtyping is decidable. We show how TF< may be embedded in the logical framework LF, and hence how results about LF may be deduced from results about TF<.

Lambda-free logical framework

Typecasting

Coercive subtyping

Type theory

Metatheory

Författare

Robin Adams

Chalmers, Data- och informationsteknik, Datavetenskap

30-39

Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, LFMTP 09
Montreal, Canada,

Ämneskategorier

Algebra och logik

Datavetenskap (datalogi)

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

DOI

10.1145/1577824.1577830

Mer information

Skapat

2018-08-23