Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Coercive Subtyping in Lambda-free Logical Frameworks Robin Adams
 

Summary: Coercive Subtyping in Lambda-free Logical Frameworks
Robin Adams
Royal Holloway, University of London
robin@cs.rhul.ac.uk
Abstract
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<.
Categories and Subject Descriptors F.4.1 [Mathematical Logic
and Formal Languages]: Mathematical Logic--Lambda calculus
and related systems, Mechanical theorem proving; I.2.3 [Artifi-
cial Intelligence]: Deduction and Theorem Proving--Metatheory;
I.2.4 [Artificial Intelligence]: Knowledge Representation

  

Source: Adams, Robin - Department of Computer Science, Royal Holloway, University of London

 

Collections: Computer Technologies and Information Sciences