Semantic subtyping

Abstract. Earlier work explored the introduction of session types into object oriented languages. Following the session types literature, two parties would start communicating, provided the types attached to that communication, i.e. the corresponding session types, were dual of each other. Then, the type system was able to ensure soundness, in the sense that two communicating partners were guaranteed to receive/send sequences of values following the order specified by their session types. In the current paper we improve upon our earlier work in two ways: we extend the type system to support bounded polymorphism, and we make the selection more object-oriented, so that control structures determine how to continue evaluation, depending on the class of the object being sent/received. Interestingly, although our notion of selection is more powerful than that in earlier work, the ensuing system turned out not to be more complex, except for the notion of duality, which needed to be extended, to correctly deal with bounded polymorphism, and to capture the new notion of selection. The paper contains an example, informal explanations, a formal description of the operational semantics and of type system, and a proof of subject reduction.

show abstract

“…The selection on the basis of the exchanged object class is reminiscent of the semantic subtyping approach [8,9,14].…”

Section: Introductionmentioning

confidence: 99%

Bounded Session Types for Object Oriented Languages

Dezani‐Ciancaglini

Giachino

Drossopoulou

et al. 2007

Formal Methods for Components and Objects

View full text Add to dashboard Cite

show abstract

“…The theory of semantic subtyping [20] was originally motivated by the problem of developing a subtype system for XML Schema. Semantic subtyping employs a denotational model of types to derive a subtype relation.…”

Section: Type Systems For Semi-structured Datamentioning

confidence: 99%

A descriptive type foundation for RDF Schema

Ciobanu

Horne

Sassone

2016

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

This paper provides a type theoretic foundation for descriptive types that appear in Linked Data. Linked Data is data published on the Web according to principles and standards supported by the W3C. Such Linked Data is inherently messy: this is due to the fact that instead of being assigned a strict a priori schema, the schema is inferred a posteriori. Moreover, such a posteriori schema consists of opaque names that guide programmers, without prescribing structure. We employ what we call a descriptive type system for Linked Data. This descriptive type system differs from a traditional type system in that it provides hints or warnings rather than errors and evolves to describe the data while Linked Data is discovered at runtime. We explain how our descriptive type system allows RDF Schema inference mechanisms to be tightly coupled with domain specific scripting languages for Linked Data, enabling an interactive feedback to Web developers.

show abstract

“…There is an alternative well-developed approach to semantic theories of types and subtyping [12] in which the denotation of a type is given by the set of values which inhabit it, and subtyping is simply subset inclusion. This apparent simplicity is tempered by the fact that for non-trivial languages, such as the pi-calculus [7], there is a circularity in the constructions due to the fact that determining which terms are values depends in turn on the set of types.…”

Section: Models Of Gay and Hole Subtypingmentioning

confidence: 99%

Using Higher-Order Contracts to Model Session Types (Extended Abstract)

Bernardi

Hennessy

2014

CONCUR 2014 – Concurrency Theory

View full text Add to dashboard Cite

Abstract. Session types are used to describe and structure interactions between independent processes in distributed systems. Higher-order types are needed in order to properly structure delegation of responsibility between processes. In this paper we show that higher-order web-service contracts can be used to provide a fully-abstract model of recursive higher-order session types. The model is settheoretic, in the sense that the denotation of a contract is given by the set of contracts with which it complies; we use a novel notion of peer compliance. A crucial step in the proof of full-abstraction is showing that every contract has a non-empty denotation.

show abstract

Semantic subtyping

Cited by 112 publications

References 40 publications

Bounded Session Types for Object Oriented Languages

Bounded Session Types for Object Oriented Languages

A descriptive type foundation for RDF Schema

Using Higher-Order Contracts to Model Session Types (Extended Abstract)

Contact Info

Product

Resources

About