Skip to main content
SpringerLink
Log in

A note on abstraction in Ruby

  • Conference paper
Functional Programming, Glasgow 1991

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

This note points out that the abstraction relations that we use when designing representation changers in Ruby are exactly the difunctional relations. A simple characterisation of when the composition of two abstractions is an abstraction is also presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Graham Hutton and Ed Voermans, Making functionality more general, in this volume.

    Google Scholar 

  2. Graham Hutton and Ed Voermans, A calculational theory of pers as types, Technical report, University of Glasgow, November 1991.

    Google Scholar 

  3. A. Jaoua, A. Mili, N. Boudriga and J. L. Durieux, Regularity of relations: A measure of uniformity, Theoretical Computer Science 79, 1991. pp. 323–339.

    Article  MATH  MathSciNet  Google Scholar 

  4. Geraint Jones, Designing circuits by calculation, MSc Course Notes, Programming Research Group technical report PRG-TR-10-90, April 1990.

    Google Scholar 

  5. Geraint Jones and Mary Sheeran, Relations and refinement in circuit design, in [8]. pp. 133–152.

    Google Scholar 

  6. Geraint Jones and Mary Sheeran, Circuit design in Ruby, in [9]. pp. 13–70.

    Google Scholar 

  7. Geraint Jones and Mary Sheeran, Designing arithmetic circuits by refinement in Ruby, in preparation.

    Google Scholar 

  8. Carroll Morgan and Jim Woodcock (eds.), Proc. BCS FACS 3rd Refinement Workshop, Jan. 1990, Springer Workshops in Computing, Springer Verlag, London, 1991.

    Google Scholar 

  9. Jørgen Staunstrup (ed.), Formal methods for VLSI design, North-Holland, 1990.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Science Dept., Glasgow University, Glasgow, G12 8QQ, Scotland

    Mary Sheeran

Authors
  1. Mary Sheeran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, The University, Glasgow, G12 8QQ, Scotland

    Rogardt Heldal BSc , Carsten Kehler Holst cand. Scient.  & Philip Wadler PhD ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1992 British Computer Society

About this paper

Cite this paper

Sheeran, M. (1992). A note on abstraction in Ruby. In: Heldal, R., Holst, C.K., Wadler, P. (eds) Functional Programming, Glasgow 1991. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3196-0_27

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3196-0_27

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19760-7

  • Online ISBN: 978-1-4471-3196-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation