Subtyping first-class polymorphic components
João Costa Seco,Luís Caires +1 more
- 04 Apr 2005
- pp 342-356
TL;DR: The design of a type system that combines first class polymorphic values with structural equirecursive types and admits a subtyping algorithm which is arguably much simpler than existing alternatives is designed.
read more
Abstract: We present a statically typed, class-based object oriented language where classes are first class polymorphic values. A main contribution of this work is the design of a type system that combines first class polymorphic values with structural equirecursive types and admits a subtyping algorithm which is arguably much simpler than existing alternatives. Our development is modular and can be easily instantiated for either a Kernel-Fun or a $F_{\leq}^{\top}$ style of subtyping discipline.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Types for dynamic reconfiguration
João Costa Seco,Luís Caires +1 more
- 27 Mar 2006
TL;DR: In this article, a core language combining computational and architectural primitives is defined, and static typing may be used to ensure safety properties of component composition and dynamic reconfiguration in object-based systems.
Composing Interfering Abstract Protocols
Filipe Militão,Jonathan Aldrich,Luís Caires +2 more
- 01 Apr 2016
TL;DR: It is shown that the composition procedure is decidable and that it ensures safe interference even when composing abstract protocols, and how this same protocol framework can be used to model safe, typeful message-passing concurrency idioms.
8
Subtyping first-class polymorphic components
João Costa Seco,Luís Caires +1 more
- 04 Apr 2005
TL;DR: The design of a type system that combines first class polymorphic values with structural equirecursive types and admits a subtyping algorithm which is arguably much simpler than existing alternatives is designed.
•Dissertation
Rely-guarantee protocols for safe interference over shared memory
Filipe David Oliveira Militão
- 01 Dec 2015
TL;DR: This thesis describes a novel technique, rely-guarantee protocols, that structures the interactions between aliases and ensures that only safe interference is possible and shows that protocol composition can ensure safety even when considering abstracted protocols.
3
•Proceedings Article
Membership Checking in Greatest Fixpoints Revisited.
Martin Hofmann,Dulma Rodriguez +1 more
- 01 Jan 2009
TL;DR: The algorithm for computing membership in the gfp of arbitrary monotone operators is extended and a new proof of correctness for it based on coinduction is provided.
1
References
•Book
Types and Programming Languages
Benjamin C. Pierce
- 01 Jan 2002
TL;DR: This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
2.7K
Featherweight Java: a minimal core calculus for Java and GJ
TL;DR: This work extends Featherweight Java with generic classes in the style of GJ and gives a detailed proof of type safety, which formalizes for the first time some of the key features ofGJ.
A New Approach to Abstract Syntax with Variable Binding
TL;DR: Inductively defined FM-sets involving the name-abstraction set former can correctly encode syntax modulo renaming of bound variables, and the standard theory of algebraic data types can be extended to encompass signatures involving binding operators.
Bounded Quantification Is Undecidable
TL;DR: A reduction from the halting problem for two-counter Turing machines is used to show that the subtyping and typing relations of F?
158
Coherence of subsumption, minimum typing and type-checking in F ≤
TL;DR: A normalizing rewriting system on proofs is defined, which transforms different proofs of the same typing judgement into a unique normal proof, with the further property that all the normal proofs assigning different types to a given term in a given environment differ only by a final application of the subsumption rule.
138