Entry Joy:1985:ECC from complngs.bib

Last update: Thu Jun 20 02:00:37 MDT 2019                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | 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{Joy:1985:ECC,
  author =       "M. S. Joy and V. J. Rayward-Smith and F. W. Burton",
  title =        "Efficient Combinator Code",
  journal =      j-COMP-LANGS,
  volume =       "10",
  number =       "3-4",
  pages =        "211--224",
  month =        "????",
  year =         "1985",
  CODEN =        "COLADA",
  ISSN =         "0096-0551 (print), 1873-6742 (electronic)",
  ISSN-L =       "0096-0551",
  bibdate =      "Tue Mar 25 14:04:06 MST 1997",
  bibsource =    "Compendex database;
                 http://www.math.utah.edu/pub/tex/bib/complngs.bib",
  acknowledgement = ack-nhfb,
  affiliation =  "Univ of East Anglia, Sch of Computing Studies \&
                 Accountancy, Norwich, Engl",
  affiliationaddress = "Univ of East Anglia, Sch of Computing Studies \&
                 Accountancy, Norwich, Engl",
  classcodes =   "C1160 (Combinatorial mathematics); C4240 (Programming
                 and algorithm theory); C6120 (File organisation)",
  classification = "723",
  corpsource =   "Sch. of Comput. Studies and Accountancy, East Anglia
                 Univ., Norwich, UK",
  journal-URL =  "http://www.sciencedirect.com/science/journal/00960551",
  journalabr =   "Comput Lang",
  keywords =     "abstracting variables; abstraction algorithm; code;
                 combinator code; combinatorial mathematics;
                 combinators; combinatory logic; combinatory logics;
                 computational complexity; computer programming ---
                 Algorithms; computer software; data; functional
                 languages; functional programs; NP-complete;
                 np-completeness; object; optimisation; structures",
  treatment =    "T Theoretical or Mathematical",
}

Related entries