@inproceedings{fb00145ce4d44e6b99ea4b36e051034b,
title = "Types, subtypes, and ASL+",
abstract = "ASL+ is a formalism for specification and programming in-the-large, based on an arbitrary institution. It has rules for proving the satisfaction and refinement of specifications, which can be seen as a type theory with subtyping, including contravariant refinement for II-abstracted specifications and a notion of stratified equality for higher-order objects. We describe the syntax of the language and a partial equivalence relation semantics. This style of semantics is familiar from subtyping calculi, but a novelty here is the use of a hierarchy of typed domains instead of a single untyped domain. We introduce the formal system for proving satisfaction and refinement and describe how it is linked to proof systems of the underlying programming and specification languages.",
author = "David Aspinall",
year = "1995",
doi = "10.1007/BFb0014424",
language = "English",
isbn = "978-3-540-59132-0",
volume = "906",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "116--131",
editor = "Egidio Astesiano and Gianna Reggio and Andrzej Tarlecki",
booktitle = "Recent Trends in Data Type Specification",
address = "United Kingdom",
}