Entry Ireland:1993:ESM from compj.bib

Last update: Sun Nov 30 02:31:30 MST 2003                Valid HTML 3.2!

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{Ireland:1993:ESM,
  author =       "Andrew Ireland",
  title =        "On exploiting the structure of {Martin-Lof}'s {Theory
                 of Types}",
  journal =      j-COMP-J,
  volume =       "36",
  number =       "4",
  pages =        "387--398",
  month =        aug,
  year =         "1993",
  CODEN =        "CMPJA6",
  ISSN =         "0010-4620",
  bibdate =      "Wed Jul 21 09:53:49 MDT 1999",
  bibsource =    "http://www3.oup.co.uk/computer_journal/Volume_36/Issue_04/Vol36_04.index.html",
  URL =          "http://www3.oup.co.uk/computer_journal/Volume_36/Issue_04/Vol36_04.body.html#AbstractIreland",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Artificial Intelligence, Edinburgh Univ.,
                 UK",
  author-1-adr = "Department of Artificial Intelligence, University of
                 Edinburgh, Edinburgh EHI IHN, UK",
  classcodes =   "C4240 (Programming and algorithm theory); C4210
                 (Formal logic)",
  classification = "C4210 (Formal logic); C4240 (Programming and
                 algorithm theory)",
  corpsource =   "Dept. of Artificial Intelligence, Edinburgh Univ.,
                 UK",
  keywords =     "abstract data types; cancellation; Cancellation;
                 closure; Closure; constructors; data type; Data type
                 constructors; data types; Data types; Martin-Lof's
                 Theory of Types; negation; Negation; program synthesis;
                 Program synthesis; proof procedure; Proof procedure;
                 theorem proving; type theory; uniqueness; Uniqueness",
  thesaurus =    "Abstract data types; Theorem proving; Type theory",
  treatment =    "T Theoretical or Mathematical",
}

Related entries