[113] H. Abelson and G. J. Sussman. Structure and Interpretation of Computer Programs. MIT Press, 1985.

[13] M. Arbib and L. Manes. Arrows, Structures and Functors: The Categorical Imperative. Academic Press, 1975.

[14] A. Asperti and G. Longo. Categories, Types and Structures. MIT Press, 1991.

[15] J. Barwise and J. Etchemendy. The Liar - an Essay on Truth and Circularity. Oxford University Press, 1987.

[16] F. L. Bauer and H. Wössner. Algorithmic Language and Program Development. Springer, 1982.

[17] J. W. Backus. Can programming be liberated from the von Neumann style? a functional style and its algebra of programs. Communications of the ACM, 21(8):613, 1978.

[18] J. W. Backus. Is computer science based on the wrong fundamental concept of 'program'? an extended concept. In J. C. van Vliet J. W, de Bakker, editor, Algorithmic Languages, page 133. North Holland, 1981.

[19] J. W. Backus, J. Williams, and E. W. Wimmers. An introduction to the programming language FL. In D. A. Turner, editor, Research Topics in Functional Programming, page 219. Addison Wesley, 1990.

[20] H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. North Holland, 1984.

[21] H. P. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, page 117. Clarendon Press, 1992.

[22] M. Barr and C. Wells. Category Theory for Computer Science. Prentice Hall, 1990.

[23] P. Bellot and B. Robinet. Streams are not dreams. In G. Cousineau, P.-L. Curien, and B. Robinet, editors, Combinators and Functional Programming Languages, page 1. Springer: LNCS vol. 242, 1985.

[24] Y. Ben-Asher, G. Rünger, A. Schuster, and R. Williams. 2DT-FP: An FP-based programming language for efficient parallel programming of multiprocessor networks. In A. Bode, M. Reeve, and G. Wolf, editors, PARLE '93 Parallel Architectures and Languages Europe, page 42. Springer: LNCS vol. 694, 1993.

[25] F. Bellegarde. Rewriting systems on FP expressions that reduce the number of sequences they yield. In 1984 ACM Symposium on Lisp and Functional Programming, page 63, 1984.

[26] R. S. Bird. An introduction to the theory of lists. In M. Broy, editor, Logic Programming and Calculi of Discrete Design, page 5. Springer, 1986.

[27] R. Bird and P. Wadler. Introduction to Functional Programming. Prentice Hall, 1988.

[28] R. S. Bird and O. de Moor. Solving optimisation problems with catamorphisms. In R. S. Bird, C. C. Morgan, and J. C. P. Woodcock, editors, Mathematics of Program Construction, page 44. Springer: LNCS vol. 44, 1992.

[29] R. Bird and O. de Moor. Algebra of Programming. Prentice Hall, 1997.

[30] R. V. Book. Thue systems as rewriting systems. In J.-P. Jouannaud, editor, Rewriting Techniques and Applications, page 63. Springer: LNCS vol. 202, 1985.

[31] T. H. Brus, M. C. J. D. van Eekelen, M. van Leer, and M. J. Plasmeijer. Clean - a language for functional graph rewriting. In G. Kahn, editor, Functional Programming Languages and Computer Architecture, page 367. Springer: LNCS vol. 272, 1987.

[32] W. H. Burge. Recursive Programming Techniques. Addison Wesley, 1975.

[33] W. Buszkowski, W. Marciszewski, and J. Van Benthem, editors. Categorial Grammars. John Benjamins Publishing, 1988.

[34] R. Cartwright. Lambda: the ultimate combinator. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation, page 27. Academic Press, 1991.

[35] A. Church. The calculi of lambda conversion. Princeton University Press, 1941.

[36] D. Clement, J. Despeyroux, T. Despeyroux, and G. Kahn. A simple applicative language: Mini ML. In 1986 ACM Conference on Lisp and Functional Programming, page 13, 1986.

[37] G. Cousineau, P.-L. Curien, M. Mauny, and A. Suárez. Combinateurs catégorique et implémentation des langages fonctionnels (in French). In G. Cousineau, P.-L. Curien, and B. Robinet, editors, Combinators and Functional Programming Languages, page 85. Springer: LNCS vol. 242, 1985.

[38] G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 9:203, 1987.

[39] P.-L. Curien. Categorical combinators. Information and Control, 69:188, 1986.

[40] H. Curry and R. Feys. Combinatory Logic, volume 1. North Holland, 1958.

[41] W. Dosch and B. Möller. Busy and lazy FP with infinite objects. In 1984 ACM Symposium on Lisp and Functional Programming, page 282, 1984.

[42] H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 2 - Module Specifications and Constraints. Springer, 1990.

[43] P. Fradet and D. Le Métayer. Compilation of lambda-calculus into functional machine code. In J. Díaz and F. Orejas, editors, TAPSOFT '89, page 155. Springer: LNCS vol. 352, 1989.

[44] P. Fradet and D. Le Métayer. From lambda calculus to machine code by program transformation. In J.-P Banâtre, S. B. Jones, and D. Le Métayer, editors, Prospects for Functional Programming in Software Engineering, page 121. Springer: ESPRIT Report 302, 1991.

[45] A. J. Field and P. G. Harrison. Functional Programming. Addison Wesley, 1988.

[46] J. S. Givler and R. B. Kieburtz. Schema recognition for program transformations. In 1984 ACM Symposium on Lisp and Functional Programming, page 74, 1984.

[47] D. Gries. The Science of Programming. Springer, 1981.

[48] G. Hains and C. Foisy. The data-parallel categorical abstract machine. In A. Bode, M. Reeve, and G. Wolf, editors, PARLE '93 Parallel Architectures and Languages Europe, page 56. Springer: LNCS vol. 694, 1993.

[49] J. Hannan. Making abstract machines less abstract. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, page 619. Springer: LNCS vol. 523, 1991.

[50] T. A. Hansen, T. Nikolasjen, J. L. Träff, and N. D. Jones. Experiments with implementations of two theoretical constructions. In A. R. Meyer and M. A. Taitslin, editors, Logic at Botik '89, page 119. Springer: LNCS vol. 363, 1989.

[51] D. M. Harland. Polymorphic Programming Languages - Design and Implementation. Ellis Horwood : John Wiley, 1984.

[52] P. Henderson. Functional Programming: Application and Implementation. Prentice Hall, 1980.

[53] L. Henkin, D. Monk, and A. Tarski. Cylindric Algebras I. North-Holland, 1971.

[54] M. C. Henson. Elements of Functional Languages. Blackwell, 1987.

[55] J. R. Hindley and J. P. Seldin. Introduction to Combinators and Lambda-calculus. Cambridge University Press, 1986.

[56] D. Hofstadter. Metamagical Themas: Questing for the Essence of Mind and Pattern. Basic Books, 1985.

[57] P. Hudak. Conception, evolution and application of functional programming languages. ACM Computing Surveys, page 359, 1989.

[58] J. Hughes. Why functional programming matters. In D. A. Turner, editor, Research Topics in Functional Programming, page 17. Addison Wesley, 1990.

[59] N. D. Jones. Computer implementation and applications of Kleene's S-m-n and recursion theorems. In Y. N. Moschovakis, editor, Logic from Computer Science, page 243. Springer, 1992.

[60] M. G. Kelly and N. Spies. Forth - a Text and Reference. Prentice-Hall, 1986.

[61] J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, page 1. Clarendon Press, 1992.

[62] D. E. Knuth. The Art of Computer Programming. Addison Wesley, 1973.

[63] P. M. Kogge. The Architecture of Symbolic Computers. McGraw-Hill, 1991.

[64] D. Le Métayer. Analysis of functional programs by program transformation. In S. B. Jones J.-P. Banâtre and D. Le Métayer, editors, Prospects fo Functional Programming in Software Engineering, page 87. Springer: ESPRIT Report 302, 1991.

[65] R. D. Lins. Categorical multicombinators. In G. Kahn, editor, Functional Programming Languages and Computer Architecture, page 60. Springer: LNCS vol. 274, 1987.

[66] L. Löfgren. Relative explanations of systems. In G. J. Klir, editor, Trends in General Systems Theory, page 340. Wiley-Interscience, 1972.

[67] B. J. MacLennan. Functional Programming - Practice and Theory. Addison Wesley, 1990.

[68] G. Malcolm. Homomorphisms and promotability. In J. L. A. van de Snepscheut, editor, Mathematics of Program Construction, page 335. Springer: LNCS vol. 375, 1989.

[69] R. L. Martin, editor. The Paradox of the Liar. Yale University Press, 1970.

[70] M. Mauny and A. Suárez. Implementing functional languages in the categorical abstract machine. In 1986 ACM Conference on Lisp and Functional Programming, page 266, 1986.

[71] L. Meertens. Constructing a calculus of programs. In J. L. A. van de Snepscheut, editor, Mathematics of Program Construction, page 66. Springer: LNCS vol. 375, 1989.

[72] E. Meijer, M. Fokkinga, and R. Paterson. Functional programming with bananas, lenses, envelopes and barbed wire. In J. Hughes, editor, Functional Programming and Computer Architecture, page 124. Springer: LNCS vol. 523, 1991.

[73] E. Mendelson. Introduction to Mathematical Logic. Van Nostrand Reinhold, 1964.

[74] R. T. Oehrle, E. Bach, and D. Wheeler, editors. Categorial Grammars and Natural Language Structures. Reidel, 1988.

[75] L. C. Paulson. ML for the Working Programmer. Cambridge University Press, 1992.

[76] S. L. Peyton Jones. The Implementation of Functional Languages. Prentice Hall, 1987.

[77] I. C. C. Phillips. Recursion theory. In S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1, page 79. Clarendon Press, 1992.

[78] B. C. Pierce. Basic Category Theory for Computer Scientists. MIT Press, 1991.

[79] A. Poigne. Basic category theory. In D. M. Gabbay S. Abramsky and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 1, page 413. Clarendon Press, 1992.

[80] W. V. O. Quine. Algebraic Logic and Predicate Functors. Bobs-Merrill, 1971.

[81] W. V. O. Quine. Logic based on inclusion and abstraction (originally published 1937). In Selected logic papers. Harvard University Press, 1995.

[82] J. D. Ramsdell. The CURRY chip. In 1986 ACM Conference on Lisp and Functional Programming, page 122, 1986.

[83] J.-C. Raoult and R. Sethi. Properties of a notation for combining functions. J. Assoc. for Computing Machinery, 30:595, 1983.

[84] C. Reade. Elements of Functional Programming. Addison Wesley, 1989.

[85] G. E. Revesz. Lambda Calculus, Combinators and Functional Programming. Cambridge University Press, 1988.

[86] J. C. Reynolds. The Craft of Programming. Prentice Hall, 1981.

[87] J. A. Robinson. A note on mechanizing higher order logic. In B. Meltzer and D. Michie, editors, Machine Intelligence 5, page 123. Edinburgh University Press, 1969.

[88] H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.

[89] D. E. Rydeheard. Functors and natural transformations. In D. Pitt, S. Abramsky, A. Poigne, and D. Rydeheard, editors, Category Theory and Computer Programming, page 43. Springer: LNCS vol. 240, 1985.

[90] A. Salomaa. Computation and Automata. Cambridge University Press, 1985.

[91] W. P. Salman, O. Tisserand, and B. Toulot. Forth. MacMillan, 1984.

[92] M. Schönfinkel. On the building blocks of mathematical logic. In J. van Heijenoort, editor, From Frege to Gödel, page 357. Harvard University Press, 1967. English Translation from the German original. Includes foreword by W. V. O. Quine.

[93] M. Sheeran. muFP, a language for VLSI design. In 1984 ACM Symposium on Lisp and Functional Programming, page 104, 1984.

[94] D. A. Schmidt. Denotational Semantics. Allyn and Bacon (Boston), 1986.

[95] P. H. Schmitt. A survey of rewrite systems. In E. Börger, H. Kleine Büning, and M. M. Richter, editors, CSL '87, page 235. Springer: LNCS vol. 329, 1987.

[96] M. Spivey. A categorical approach to the theory of lists. In J. L. A. van de Snepscheut, editor, Mathematics of Program Construction, page 375. Springer: LNCS vol. 375, 1989.

[97] J. Stoy. Denotational Semantics, the Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.

[98] R. M. Smullyan. Theory of Formal Systems. Princeton University Press, 1961.

[99] R. M. Smullyan. To Mock a Mockingbird. Oxford University Press, 1990.

[100] R. M. Smullyan. Diagonalisation and Self-reference. Clarendon Press, 1994.

[101] S. Sokolowski. Applicative Higher Order Programming: the Standard ML Perspective. Chapman and Hall, 1991.

[102] R. D. Tennent. The denotational semantics of programming languages. Communications of the ACM, 19:437, 1976.

[103] R. D. Tennent. Semantics of Programming Languages. Prentice Hall, 1991.

[104] S. Thompson. Type Theory and Functional Programming. Addison Wesley, 1991.

[105] S. Thompson. Miranda: The Craft of Functional Programming. Addison Wesley, 1995.

[106] D. A. Turner. A new implementation technique for applicative languages. Software - Practice and Experience, 9:31, 1979.

[107] D. A. Turner. An overview of Miranda. In D. A. Turner, editor, Research Topics in Functional Programming, page 1. Addison Wesley, 1990.

[108] P. Wadler. The essence of functional programming. In 19th Annual Symposium on Principles of Programming Languages, Albuquerque, 1992.

[109] B. Wald. A theory of unary pairfunctions. In M. Droste and Y. Gurevich, editors, Semantics of Programming Languages and Model Theory, page 287. Gordon and Breach Science Publishers, 1993.

[110] R. F. C. Walters. Categories and Computer Science. Cambridge University Press, 1991.

[111] J. H. Williams. Notes on the FP style of programming. In J. Darlington, P. Henderson, and D. A. Turner, editors, Functional Programming and its Applications, page 73. Cambridge University Press, 1982.

[112] G. Winskel. The Formal Semantics of Programming Languages. MIT Press, 1993.

[1] M. von Thun. Lambda calculus vs. combinatory logic vs. Joy - a very very gentle introduction. Available from the author, 1997.

[2] M. von Thun. A short overview of Joy. Available from the author, 1994.

[3] M. von Thun. Overview of Joy. Available from the author, 1994.

[4] M. von Thun. An informal tutorial on Joy. Available from the author, 1994.

[5] M. von Thun. Mathematical foundations of Joy. Available from the author, 1994.

[6] M. von Thun. Atomic programs of Joy. Available from the author, 1995.

[7] M. von Thun. The algebra of Joy. Available from the author, 1995.

[8] M. von Thun. Computability and Joy. Available from the author, 1996.

[9] M. von Thun. Simple programming in Joy. Available from the author, 1996.

[10] M. von Thun. A rewriting system for joy. Available from the author, 1996.

[11] M. von Thun. Joy compared with other functional languages. Available from the author, 1996.

[12] M. von Thun. The Joy of Computer Programming. In preparation, 00.