Entry Bird:1989:AIP from compj1980.bib

Last update: Sat Jan 6 02:03:49 MST 2018                Valid HTML 3.2!

Index sections

Top | Symbols | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Bird:1989:AIP,
  author =       "R. S. Bird",
  title =        "Algebraic Identities for Program Calculation",
  journal =      j-COMP-J,
  volume =       "32",
  number =       "2",
  pages =        "122--126",
  month =        apr,
  year =         "1989",
  CODEN =        "CMPJA6",
  DOI =          "https://doi.org/10.1093/comjnl/32.2.122",
  ISSN =         "0010-4620 (print), 1460-2067 (electronic)",
  ISSN-L =       "0010-4620",
  MRclass =      "68N05",
  MRnumber =     "990 780",
  bibdate =      "Tue Dec 4 14:48:26 MST 2012",
  bibsource =    "Compendex database;
                 http://comjnl.oxfordjournals.org/content/32/2.toc;
                 http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/;
                 Misc/Functional.bib",
  URL =          "http://comjnl.oxfordjournals.org/content/32/2/122.full.pdf+html;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/122.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/123.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/124.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/125.tif;
                 http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/126.tif",
  abstract =     "There is a style of functional programming which
                 focuses attention on a small collection of powerful
                 higher-order functions that capture common patterns of
                 computation. The idea is to try and express programs in
                 terms of the composition of particular instances of
                 these useful functions. Explicit use of recursion is
                 therefore avoided, except as a last resort. A similar,
                 indeed dual, style can be advocated when it comes to
                 program proof. The idea here is to try and conduct
                 proofs through equational reasoning that exploits the
                 algebraic properties of the collection of higher-order
                 functions. Explicit use of induction is therefore
                 avoided.",
  acknowledgement = ack-nhfb,
  affiliation =  "Oxford Univ.",
  affiliationaddress = "Oxford, Engl",
  classcodes =   "C6110 (Systems analysis and programming)",
  classification = "723; C6110 (Systems analysis and programming)",
  corpsource =   "Oxford Univ., UK",
  fjournal =     "The Computer Journal",
  journal-URL =  "http://comjnl.oxfordjournals.org/",
  keywords =     "algebra; algebraic; Algebraic identities; Algebraic
                 Identities; Computer Metatheory--Programming Theory;
                 Equational reasoning; Equational Reasoning; equational
                 reasoning; Functional Programming; functional
                 programming; Functional programming, Computer
                 Programming; Higher-order functions; higher-order
                 functions; identities; Program calculation; Program
                 Calculation; program calculation; Theory",
  thesaurus =    "Algebra; Functional programming",
  treatment =    "P Practical",
}

Related entries