Skip to main content
SpringerLink
Log in

Types, subtypes, and ASL+

  • Contributed Papers
  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1994, COMPASS 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 906))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. David R. Aspinall. Subtyping with singleton types. Paper given at Computer Science Logic '94, Kazimierz, Poland, 1994.

    Google Scholar 

  2. David R.Aspinall. Algebraic specification in a type-theoretic setting. Forthcoming PhD thesis, Department of Computer Science, University of Edinburgh, 1995.

    Google Scholar 

  3. Arnon Avron. Simple consequence relations. Information and Computation, 92:105–139, 1991.

    Article  Google Scholar 

  4. Val Breazu-Tannen, Thierry Coquand, Carl A. Gunter, and Andre Scedrov. Inheritance as implicit coercion. Information and Computation, 93:172–221, 1991.

    Article  Google Scholar 

  5. Luca Cardelli. Structural subtyping and the notion of power type. In Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988.

    Google Scholar 

  6. Luca Cardelli and Guiseppe Longo. A semantic basis for Quest. Journal of Functional Programming, 1(4):417–458, 1991.

    Google Scholar 

  7. Maria Victoria Cengarle and Martin Wirsing. A calculus of parameterization for algebraic specifications. Technical Report 94/198, Department of Computer Science, Monsahs University, 1994.

    Google Scholar 

  8. Pierre-Louis Curien and Giorgio Ghelli. Coherence of subsumption, minimum typing and type-checking in F≤. Mathematical Structures in Computer Science, 2:55–91, 1992. Also in Carl A. Gunter and John C. Mitchell, editors, Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design (MIT Press, 1994).

    Google Scholar 

  9. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In van Leeuwen et.al., editor, Handbook of Theoretical Computer Science, chapter 6. North-Holland, 1990.

    Google Scholar 

  10. Sophia Drossopoulou and Ross Paterson. Higher order module parameterization. Technical report, Department of Computing, Imperial College, October 1993.

    Google Scholar 

  11. Jorge Farrés-Cassals. Verification in ASL and related Specification Languages. PhD thesis, Edinburgh University, 1992.

    Google Scholar 

  12. J. A. Goguen and R. M. Burstall. Institutions: abstract model theory for specification and programming. Journal of the ACM, 39:95–146, 1992.

    Article  Google Scholar 

  13. Bernd Krieg-Brückner and Donald Sannella. Structuring specifications in-the-large and in-the-small: Higher-order functions, dependent types and inheritance in SPECTRAL. In TAPSOFT '91: Proc. Joint Conf. on Theory and Practice of Software Development, Brighton, 1991.

    Google Scholar 

  14. Benjamin C. Pierce. Bounded quantification is undecidable. Information and Computation, 112(1), July 1994.

    Google Scholar 

  15. Donald T. Sannella, Stefan Sokolowski, and Andrzej Tarlecki. Toward formal development of programs from algebraic specifications: Parameterisation revisited. Acta Informatica, 29:689–736, 1992.

    Article  Google Scholar 

  16. Donald T. Sannella and Andrzej Tarlecki. Specifications in an arbitrary institution. Information and Computation, 76(2/3):165–210, 1988.

    Article  Google Scholar 

  17. Stefan Sokolowski. Parametricity in algebraic specifications: A case study. Technical report, Institute of Computer Science, Polish Academy of Sciences, Gdańsk, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, UK

    David Aspinall

Authors
  1. David Aspinall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egidio Astesiano Gianna Reggio Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Aspinall, D. (1995). Types, subtypes, and ASL+. In: Astesiano, E., Reggio, G., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1994 1994. Lecture Notes in Computer Science, vol 906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014424

Download citation

  • DOI: https://doi.org/10.1007/BFb0014424

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59132-0

  • Online ISBN: 978-3-540-49198-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation