Skip to main content
Journal ArticleOPEN ACCESS

Typed operational semantics for higher-order subtyping

Information and Computation (2003) 184(2) 242-297
DOI: 10.1016/S0890-5401(03)00062-2
20Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Bounded operator abstraction is a language construct relevant to object-oriented programming languages and to ML2000, the successor to Standard ML. In this paper, we introduce ℱ≤ω, a variant of F

Author supplied keywords

Cite

CITATION STYLE

APA

Compagnoni, A., & Goguen, H. (2003). Typed operational semantics for higher-order subtyping. Information and Computation, 184(2), 242–297. https://doi.org/10.1016/S0890-5401(03)00062-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free