Abstract
Things should be as simple as possible ‘and no simpler’, so they say. This paper is about simplifying a construct in Ruby, to reduce the complexity of the algebra without sacrificing expressive power. Ruby, for which Mary Sheeran is largely responsible, is a language of relations and a collection of rules - equalities - for algebraic transformation of expressions in that language.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Backus J. Can programming be liberated from the von Neumann style? a functional style and its algebra of programs. Commun ACM 1978; 21: 613–641
Jones G. Designing circuits by calculation. Programming Research Group technical report PRG-TR-10-90. Oxford University Computing Laboratory, 1990
Jones G, Sheeran M. Circuit design in Ruby. In: Staunstrup J (ed) Formal methods for VLSI design. North-Holland, 1990, pp 13–70
Jones G, Sheeran M. Deriving bit-serial circuits in Ruby. In: Halaas A, Denyer P (eds) VLSI’91. (Proc IFIP TC10/WG10. 5 Intl Conf, Edinburgh, Scotland, Aug 1991 ) North-Holland.
Luk W, Brown G. A systolic LRU processor and its top-down development. Sci Comp Prog, 1990; 15: 217–233
Sheeran M. µFP - an algebraic VLSI design language. Programming Research Group technical monograph PRG-39. Oxford University Computing Laboratory, 1984
Sheeran M. Describing and reasoning about circuits using relations. In: McEvoy K, Tucker JV (eds) Theoretical foundations of VLSI design. (Proc Leeds workshop, 1986) Cambridge University Press, 1990, pp 263–298
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 British Computer Society
About this paper
Cite this paper
Jones, G. (1992). Getting your wires crossed. 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_16
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3196-0_16
Publisher Name: Springer, London
Print ISBN: 978-3-540-19760-7
Online ISBN: 978-1-4471-3196-0
eBook Packages: Springer Book Archive