Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ENTCS
2002

favoriteEmaildiscussreport

91views more ENTCS 2002»

Subtyping in Logical Form

13 years 4 months ago

Subtyping in Logical Form

Download www.di.unito.it

By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as spaces of filters over a subset of the language of properties (the intersection types) which describes the underlying type free realizability structure. We show that such an interpretation is a PER semantics, proving that the quotient space arising from "logical" PERs taken with the intrinsic ordering is isomorphic to the filter semantics of types.

Ugo de'Liguoro

Real-time Traffic

ENTCS 2002 | Finitary Programming Logic | Intersection Types | Type Free Realizability |

claim paper

Related Content

» Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance

» A Bidirectional Refinement Type System for LF

» Subtyping and Parametricity

» Logical Semantics of Types for Concurrency

» Pure Subtype Systems

» Subtyping Recursive Types Modulo Associative Commutative Products

» Logical Equivalence for Subtyping Object and Recursive Types

» The Relevance of Semantic Subtyping

» ObjectOriented Verification Based on Record Subtyping in HigherOrder Logic

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	ENTCS
Authors	Ugo de'Liguoro

Comments (0)