Entry Kfoury:1992:EPF from tcs1990.bib

Last update: Wed Sep 26 02:11:46 MDT 2018                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{Kfoury:1992:EPF,
  author =       "A. J. Kfoury and J. Tiuryn and P. Urzyczyn",
  title =        "On the expressive power of finitely typed and
                 universally polymorphic recursive procedures",
  journal =      j-THEOR-COMP-SCI,
  volume =       "93",
  number =       "1",
  pages =        "1--41",
  day =          "03",
  month =        feb,
  year =         "1992",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:24:22 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
  acknowledgement = ack-nhfb,
  classification = "C4240 (Programming and algorithm theory)",
  corpsource =   "Dept. of Comput. Sci., Boston Univ., MA, USA",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "computational power; expressive power; finite
                 interpretations; finitely typed functional programs;
                 finitely typed recursive procedures; FL; functional
                 programming; halting problem; ML; P; polymorphic
                 fixpoint constructor; polymorphic let-in constructor;
                 programming language; programming theory; semantical
                 classification; syntactic classification;
                 undecidability; universally polymorphic recursive
                 procedures",
  pubcountry =   "Netherlands",
  treatment =    "T Theoretical or Mathematical",
}

Related entries