The Third Homomorphism Theorem

Journal of Functional Programming

Volumn 6, Issue 4, 1996, Pages 657-665

  Gibbons, Jeremy ^a  

^a UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346869763     PISSN: 09567968     EISSN: None     Source Type: Journal    
DOI: 10.1017/s0956796800001908     Document Type: Article

References (8)

1. Barnard, D. T., Schmeiser, J. P. and Skillicorn, D. B. (1991) Deriving associative operators for language recognition. Bulletin of the European Association for Theoretical Computer Science, 43,131-139.
2. Bird, R. S. (1987) An introduction to the theory of lists. In M. Broy (editor), Logic of Programming and Calculi of Discrete Design, pp. 3-42. Berlin: Springer-Verlag. (Also available as Technical Monograph PRG-56, from the Programming Research Group, Oxford University.)
3. Gibbons, J. (1993) Computing downwards accumulations on trees quickly. In G. Gupta, G. Mohay and R. Topor (editors), 16th Australian Computer Science Conference, pp. 685-691, Brisbane. (Available by anonymous ftp as out/jeremy/papers/quickly.ps.Z on ftp.cs.auckland.ac.nz.)
4. Gibbons, J. (1994) The Third Homomorphism Theorem. In C. Barry Jay (editor), Computing: The Australian Theory Seminar, University of Technology, Sydney.
5. Gorlatch, S. (1995) Constructing List Homomorphisms. Technical Report MIP-9512, Fakultät für Mathematik und Informatik, Universität Passau.
6. Green, C. and Barstow, B. (1978) On program synthesis knowledge. Artificial Intelligence, 10, 241-279.
7. Harel, D. (1980) On folk theorems. Comm. ACM, 23(7), 379-389.
8. Meertens, L. G. L. T. (1995) Personal communication.