Semantic subtyping: challenges, perspectives, and open problems

Authors:
Giuseppe Castagna
Affiliations:
CNRS, École Normale Supérieure de Paris, France
Venue:
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Year:
2005

Citing 16
Cited 3

Faithful ideal models for recursive polymorphic types

Proceedings of the Fourth Annual Symposium on Logic in computer science
A framework for defining logics

Journal of the ACM (JACM)
Type inclusion constraints and type inference

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Formal parametric polymorphism

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
The genericity theorem and parametricity in the polymorphic &lgr;-calculus

Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Regular expression pattern matching for XML

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents

Information and Computation
Semantic Subtyping

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
XDuce: A statically typed XML processing language

ACM Transactions on Internet Technology (TOIT)
Subtyping Dependent Types

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Assigning Types to Processes

LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
Authenticity by Typing for Security Protocols

CSFW '01 Proceedings of the 14th IEEE workshop on Computer Security Foundations
Channel dependent types for higher-order mobile processes

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parametric polymorphism for XML

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A gentle introduction to semantic subtyping

PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Semantic Subtyping for the p-Calculus

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science

Semantic subtyping for the pi-calculus

Theoretical Computer Science
Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types

Journal of the ACM (JACM)
Encoding CDuce in the Cπ-calculus

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Semantic subtyping is a relatively new approach to define subtyping relations where types are interpreted as sets and union, intersection and negation types have the corresponding set-theoretic interpretation. In this lecture we outline the approach, give an aperçu of its expressiveness and generality by applying it to the λ-calculus with recursive and product types and to the π-calculus. We then discuss in detail the new challenges and research perspectives that the approach brings forth.