Subtyping can have a simple semantics

DOI10.1016/S0304-3975(06)80005-8zbMATH Open0758.68042OpenAlexW4210462262MaRDI QIDQ1177151FDOQ1177151

Authors: Herman Balsters, Maarten M. Fokkinga 

Publication date: 26 June 1992

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(06)80005-8

Recommendations

• Coherence of subsumption for monadic types
• Automata, Languages and Programming
• Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
• Positive subtyping
• Inclusions and subtypes I: first-order case

zbMATH Keywords

semantics of typed languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (9)

• Coherence of subsumption for monadic types
• Foundations for the implementation of higher-order subtyping
• Title not available (Why is that?)
• The relevance of semantic subtyping
• Semantic subtyping, dealing set-theoretically with function, union, intersection, and negation types
• Computer Science Logic
• Theoretical Computer Science
• Inclusions and subtypes I: first-order case
• Title not available (Why is that?)

This page was built for publication: Subtyping can have a simple semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1177151)