2008/09/01 by Alain Frisch, Giuseppe Castagna, Véronique Benzaken · 9 citations
Computer Science · #Logic, programming, and type systems #Semantic Web and Ontologies #Advanced Database Systems and Queries
paper · doi:10.1145/1391289.1391293
Subtyping relations are usually defined either syntactically by a formal system or semantically by an interpretation of types into an untyped denotational model. This work shows how to define a subtyping relation semantically in the presence of Boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm.