Back to basics: Deriving representation changers functionally

Journal of Functional Programming

Volumn 6, Issue 1, 1996, Pages 181-188

  Hutton, Graham ^a   Meijer, Erik ^a,b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030552599     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001623     Document Type: Article

References (8)

1. Davio, M., Deschamps, J.-P. and Thayse, A. (1983) Digital Systems, with Algorithm Implementation. Wiley.
2. Hutton, G. (1992) Between Functions and Relations in Calculating Programs. PhD thesis, University of Glasgow. (Available as Research Report FP-93-5.)
3. Jones, G. and Sheeran, M. (1990) Circuit design in Ruby. In Staunstrup, editor, Formal Methods for VLSI Design. Elsevier.
4. Jones, G. and Sheeran, M. (1991) Relations and refinement in circuit design. In Morgan, editor, Proc. BCS FACS Workshop on Refinement: Workshops in Computing. Springer-Verlag.
5. Jones, G. and Sheeran, M. (1992) Designing arithmetic circuits by refinement in Ruby. In Proc. 2nd Int. Conf. on Mathematics of Program Construction: Lecture Notes in Computer Science. Springer-Verlag.
6. Ross, K. A. and Wright, C. R. B. (1992) Discrete Mathematics. Prentice-Hall.
7. Runciman, C. and Jagger, N. (1990) Relative specification and transformational re-use of functional programs. Lisp and Symbolic Computation, 3: 21-37.
8. Sheeran, M. (1986) Describing and reasoning about circuits using relations. In Tucker et al., editors, Proc. Workshop in Theoretical Aspects of VLSI. Leeds, UK.