@INCOLLECTION{Sands:HOOTS,
  author = {David Sands},
  title = {Improvement Theory and Its Applications},
  pages = {275--306},
  editor = {A. D. Gordon and A. M. Pitts},
  booktitle = {Higher {O}rder {O}perational {T}echniques in {S}emantics},
  publisher = {Cambridge University Press},
  series = {Publications of the Newton Institute},
  year = {1998},
  abstract = {An improvement theory is a variant of the standard
  theories of observational approximation (or equivalence) in which the basic
  observations made of a functional program's execution include some
  intensional information about, for example, the program's computational cost.
  One program is an improvement of another if its execution is more efficient
  in any program context. In this article we give an overview of our work on
  the theory and applications of improvement. Applications include reasoning
  about time properties of functional programs, and proving the correctness of
  program transformation methods. We also introduce a new application, in the
  form of some bisimulation-like proof techniques for equivalence, with
  something of the flavour of Sangiorgi's ``bisimulation up-to expansion and
  context''.},
  url_Paper = {http://www.cse.chalmers.se/~dave/papers/hoots97.pdf},
}

{"_id":"yawCxdNBFhoMBTYcT","bibbaseid":"sands-improvementtheoryanditsapplications-1998","downloads":0,"creationDate":"2017-02-03T08:24:26.836Z","title":"Improvement Theory and Its Applications","author_short":["Sands, D."],"year":1998,"bibtype":"incollection","biburl":"http://www.cse.chalmers.se/~dave/davewww2016.bib","bibdata":{"bibtype":"incollection","type":"incollection","author":[{"firstnames":["David"],"propositions":[],"lastnames":["Sands"],"suffixes":[]}],"title":"Improvement Theory and Its Applications","pages":"275--306","editor":[{"firstnames":["A.","D."],"propositions":[],"lastnames":["Gordon"],"suffixes":[]},{"firstnames":["A.","M."],"propositions":[],"lastnames":["Pitts"],"suffixes":[]}],"booktitle":"Higher Order Operational Techniques in Semantics","publisher":"Cambridge University Press","series":"Publications of the Newton Institute","year":"1998","abstract":"An improvement theory is a variant of the standard theories of observational approximation (or equivalence) in which the basic observations made of a functional program's execution include some intensional information about, for example, the program's computational cost. One program is an improvement of another if its execution is more efficient in any program context. In this article we give an overview of our work on the theory and applications of improvement. Applications include reasoning about time properties of functional programs, and proving the correctness of program transformation methods. We also introduce a new application, in the form of some bisimulation-like proof techniques for equivalence, with something of the flavour of Sangiorgi's ``bisimulation up-to expansion and context''.","url_paper":"http://www.cse.chalmers.se/~dave/papers/hoots97.pdf","bibtex":"@INCOLLECTION{Sands:HOOTS,\n author = {David Sands},\n title = {Improvement Theory and Its Applications},\n pages = {275--306},\n editor = {A. D. Gordon and A. M. Pitts},\n booktitle = {Higher {O}rder {O}perational {T}echniques in {S}emantics},\n publisher = {Cambridge University Press},\n series = {Publications of the Newton Institute},\n year = {1998},\n abstract = {An improvement theory is a variant of the standard\n theories of observational approximation (or equivalence) in which the basic\n observations made of a functional program's execution include some\n intensional information about, for example, the program's computational cost.\n One program is an improvement of another if its execution is more efficient\n in any program context. In this article we give an overview of our work on\n the theory and applications of improvement. Applications include reasoning\n about time properties of functional programs, and proving the correctness of\n program transformation methods. We also introduce a new application, in the\n form of some bisimulation-like proof techniques for equivalence, with\n something of the flavour of Sangiorgi's ``bisimulation up-to expansion and\n context''.},\n url_Paper = {http://www.cse.chalmers.se/~dave/papers/hoots97.pdf},\n}\n","author_short":["Sands, D."],"editor_short":["Gordon, A. D.","Pitts, A. M."],"key":"Sands:HOOTS","id":"Sands:HOOTS","bibbaseid":"sands-improvementtheoryanditsapplications-1998","role":"author","urls":{" paper":"http://www.cse.chalmers.se/~dave/papers/hoots97.pdf"},"downloads":0},"search_terms":["improvement","theory","applications","sands"],"keywords":[],"authorIDs":["58943e3a2f18920f4c000022"],"dataSources":["SBHWXKotbthoEYKJv"]}