Constructing tournament representations: An exercise in pointwise relational programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2386, Issue , 2002, Pages 131-147

  Hinze, Ralf ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

NONDETERMINISTIC PROGRAMS; POINT WISE; PROGRAM CALCULATION;

ARTIFICIAL INTELLIGENCE;

EID: 84959038813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45442-X_9     Document Type: Conference Paper

References (27)

1. Lex Augusteijn. An alternative derivation of a binary heap construction function. In R.S. Bird, C.C. Morgan, and J.C.P Woodcock, editors, Second International Conference on the Mathematics of Program Construction, Oxford, volume 669 of Lecture Notes in Computer Science, pages 368-374. Springer, 1992.
2. Roland Backhouse. Galois connections and fixed point calculus, 2001. Lecture Notes.
3. Richard Bird. Introduction to Functional Programming using Haskell. Prentice Hall Europe, London, 2nd edition, 1998.
4. Richard Bird and Oege de Moor. Algebra of Programming. Prentice Hall Europe, London, 1997.
5. Richard S. Bird. Lectures on constructive functional programming. In Manfred Broy, editor, Constructive Methods in Computer Science. Springer-Verlag, 1988.
6. R. Burstall and J. Darlington. A tranformation system for developing recursive programs. Journal of the ACM, 24(1):44-67, 1977.
7. Oege de Moor and Jeremy Gibbons. Pointwise relational programming. In T. Rus, editor, Proceedings of Algebraic Methodology and Software Technology (AMAST 2000), Iowa, volume 1816 of Lecture Notes in Computer Science, pages 371-390. Springer-Verlag, May 2000.
8. R.W. Floyd. Syntactic analysis and operator precedence. Journal of the ACM, 10(3):316-333, 1963.
9. H.N. Gabow, J.L. Bentley, and R.E. Tarjan. Scaling and related techniques for geometry problems. In Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pages 135-143, 1984.
10. Cordelia V. Hall, Kevin Hammond, Simon L. Peyton Jones, and Philip L. Wadler. Type classes in Haskell. ACM Transactions on Programming Languages and Systems, 18(2):109-138, March 1996.
11. Michael Hanus, editor. Curry—An Integrated Functional Logic Language (Version 0.7.1), June 2000.
12. Ralf Hinze. Prolog’s control constructs in a functional setting—Axioms and implementation. International Journal of Foundations of Computer Science, 12(2):125-170, 2001.
13. Ralf Hinze and Ross Paterson. Derivation of a typed functional LR parser, 2002. in preparation.
14. B. Knaster. Un théorème sur les fonctions d’ensembles. Annales de la Societé Polonaise de Mathematique, 6:133-134, 1928.
15. Christos Levcopoulos and Ola Petersson. Heapsort—adapted for presorted files. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Algorithms and Data Structures, volume 382 of Lecture Notes in Computer Science, pages 499-509. Springer, 1989.
16. Eugenio Moggi. An abstract view of programming languages. Technical Report ECS-LFCS-90-113, Department of Computer Science, Edinburgh University, 1990.
17. Eugenio Moggi. Notions of computation and monads. Information and Computation, 93(1):55-92, 1991.
18. Helmut A. Partsch. Specification and Transformation of Programs—A Formal Approach to Software Development. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, 1990.
19. Simon Peyton Jones and John Hughes, editors. Haskell 98 — A Non-strict, Purely Functional Language, February 1999. Available from http://www.haskell.org/definition/.
20. Berry Schoenmakers. Inorder traversal of a binary heap and its inversion in optimal time and space. In R.S. Bird, C.C. Morgan, and J.C.P Woodcock, editors, Second International Conference on the Mathematics of Program Construction, Oxford, volume 669 of Lecture Notes in Computer Science, pages 291-301. Springer, 1992.
21. Michael Sperber and Peter Thiemann. Generation of LR parsers by partial evaluation. ACM Transactions on Programming Languages and Systems, 22(3):224-264, 2000.
22. J.M. Spivey and S. Seres. Embedding Prolog in Haskell. In Erik Meijer, editor, Proceedings of the 3rd Haskell Workshop, Paris, France, September 1999. The proceedings appeared as a technical report of Universiteit Utrecht, UU-CS-1999-28.
23. H. Tamaki and T. Sato. Unfold/fold transformations of logic programs. In Second International Conference on Logic Programming, pages 127-138, 1984.
24. A. Tarski. A lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285-309, 1955.
25. Paul Taylor. Practical Foundations of Mathematics. Number 59 in Cambridge Studies in Advanced Mathematics. Cambridge University Press, 1999.
26. Jean Vuillemin. A unifying look at data structures. Communications of the ACM, 23:229-239, 1980.
27. Philip Wadler. Comprehending monads. In Proceedings of the 1990 ACM Conference on LISP and Functional Programming, Nice, pages 61-78. ACM-Press, June 1990.