Maarten M Fokkinga  @ NUS Home/Search
Context Related
| db.cs.utwente.nl/P...wente4050799D.pdf Cached: PS.gz PS PDF Image Update Help From: wwwhome.cs.utwente.nl/~fokking... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a formal derivation of program schemes that are usually called Backtracking programs and Branch-and-Bound programs. The derivation consists of a series of transformation steps, specifically algebraic manipulations, on the initial specification until the desired programs are obtained. The well-known notions of linear recursion and tail recursion are extended, for structures, to elementwise linear recursion and elementwise tail recursion; and a transformation between them is... (Update)
Context of citations to this paper: More
...formalism for lists. Researchers in this field are Skillicorn [Ski90, Ski93] Jones [JG92] de Moor [SdM] Cole [Col93] Fokkinga [Fok91] and others. They mostly use the formalism for specifying and parallelizing problems in which lists are the basic data structure....
Cited by: More
Parallelization of Divide-and-Conquer in the Bird-Meertens.. - Gorlatch, Lengauer (1995) (Correct)
Active bibliography (related documents): More All
0.4: Program Calculation Properties of Continuous Algebras - Fokkinga, Meijer (1991) (Correct)
0.1: A Survey of Formal Software Development Methods - Sannella (1988) (Correct)
0.1: Calculate Categorically! - Fokkinga (1992) (Correct)
Similar documents based on text: More All
0.2: Comparing Refinements for Failure and Bisimulation Semantics - Eshuis (1999) (Correct)
0.2: Subtyping can have a Simple Semantics - Balsters, Fokkinga (1991) (Correct)
0.2: Adjunctions - Fokkinga, Meertens (1993) (Correct)
BibTeX entry: (Update)
M. Fokkinga. An exercise in transformational programming: Backtracking and branch-and-bound. Science of Computer Programming, 16:19--48, 1991. http://citeseer.comp.nus.edu.sg/686071.html More
@misc{ fokkinga91exercise,
author = "M. Fokkinga",
title = "An exercise in transformational programming: Backtracking and branch-and-bound",
text = "M. Fokkinga. An exercise in transformational programming: Backtracking
and branch-and-bound. Science of Computer Programming, 16:19--48, 1991.",
year = "1991",
url = "citeseer.comp.nus.edu.sg/686071.html" }
Citations (may not include all citations):652 A Discipline of Programming (context) - Dijkstra - 1976
650 An axiomatic basis for computer programming (context) - Hoare - 1969
273 Can programming be liberated from the Von Neumann style (context) - Backus - 1978
172 An introduction to the theory of lists (context) - Bird - 1987
91 Program development by stepwise refinement (context) - Wirth - 1971
81 The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
81 Algorithmics --- towards programming as a mathematical activ.. (context) - Meertens - 1986
77 nondeterminacy and formal derivation of programs (context) - Dijkstra - 1975
67 Formal Aspects of Computing (context) - Meertens - 1990
65 How to replace failure by a list of successes (context) - Wadler - 1985
63 Algebraic Data Types and Program Transformation (context) - Malcolm - 1990
41 Homomorphisms and promotability (context) - Malcolm - 1989
33 A survey and classification of some program transformation a.. (context) - Feather - 1987
27 A synthesis of several sorting algorithms (context) - Darlington - 1978
17 Formal derivation of a pattern matching algorithm (context) - Bird, Gibbons et al. - 1989
7 The design of well-structured and correct programs (context) - Alagic, Arbib - 1978
7 Lecture notes on constructive functional programming (context) - Bird - 1989
6 Transformational program development in a particular problem.. (context) - Partsch - 1986
1 Backtracking and branch-and-bound functionally expressed (context) - Fokkinga - 1987
1 Further thoughts on Abstracto (context) - Boom - 1981
1 the design of generate-and-test algorithms: subspace generat.. (context) - Smith - 1987
1 A Appendix: some proofs We shall derive equation (context) - Wirth, Data et al. - 1976
Documents on the same site (http://wwwhome.cs.utwente.nl/~fokkinga/): More
Machine Assisted Constraint Maintenance - Fokkinga (1996) (Correct)
Subtyping can have a Simple Semantics - Balsters, Fokkinga (1991) (Correct)
Functional Programming with Bananas, Lenses, Envelopes.. - Meijer, Fokkinga.. (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.