Adams, Robin (2009) Coercive Subtyping in Lambda-Free Logical Frameworks In: Proceedings of the Fourth international Workshop on Logical Frameworks and Meta-Languages. ACM.
Full text access: Open
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<
This is a Submitted version This version's date is: 2009 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/e422d8df-0a26-326e-3f2b-08448e6a7285/2/
Deposited by Research Information System (atira) on 06-Jun-2012 in Royal Holloway Research Online.Last modified on 06-Jun-2012