Constructing Tournament Representations: An Exercise in Pointwise Relational Programming

@inproceedings{Hinze2002ConstructingTR,
  title={Constructing Tournament Representations: An Exercise in Pointwise Relational Programming},
  author={Ralf Hinze},
  booktitle={MPC},
  year={2002}
}
List or set comprehensions are a wonderful means to define nondeterministic or relational programs. Despite their beauty, comprehensions are somewhat underused in program calculation. The purpose of this paper is to remind the program-calculation community that comprehensions provide a convenient language for specifying and deriving nondeterministic programs in a pointwise manner. We illustrate the style of reasoning by re-solving the well-known problem of constructing tournament… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
5 Extracted Citations
31 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 31 references

Derivation of a typed functional LR parser

  • Ralf Hinze, Ross. Paterson
  • 2003
1 Excerpt

Derivation of a typed functional LR parser. in preparation

  • Hinze, Ralf, Paterson, Ross
  • 2003

Constructing tournament representations : An exercise in pointwise relational programming

  • Ralf. Hinze
  • Pages 131 – 147 of :
  • 2002

Constructing tournament representations: An exercise in pointwise relational programming. Pages 131–147

  • Hinze, Ralf
  • germany, july 8-10,
  • 2002

June). Curry—an integrated functional logic language (version

  • Hanus, Michael ed
  • 2000

Similar Papers

Loading similar papers…