Entry Waddell:2005:FLF from higherordersymbcomput.bib

Last update: Sun Oct 15 02:16:54 MDT 2017                Valid HTML 3.2!

Index sections

Top | 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{Waddell:2005:FLF,
  author =       "Oscar Waddell and Dipanwita Sarkar and R. Kent
                 Dybvig",
  title =        "Fixing {Letrec}: a Faithful Yet Efficient
                 Implementation of {Scheme}'s Recursive Binding
                 Construct",
  journal =      j-HIGHER-ORDER-SYMB-COMPUT,
  volume =       "18",
  number =       "3--4",
  pages =        "299--326",
  month =        dec,
  year =         "2005",
  CODEN =        "LSCOEX",
  DOI =          "https://doi.org/10.1007/s10990-005-4878-3",
  ISSN =         "1388-3690 (print), 2212-0793 (electronic)",
  ISSN-L =       "1388-3690",
  bibdate =      "Wed Jul 9 12:34:44 MDT 2008",
  bibsource =    "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=18&issue=3;
                 http://www.math.utah.edu/pub/tex/bib/higherordersymbcomput.bib",
  URL =          "http://www.springerlink.com/openurl.asp?genre=article&issn=1388-3690&volume=18&issue=3&spage=299",
  acknowledgement = ack-nhfb,
  journal-URL =  "http://link.springer.com/journal/10990",
  keywords =     "internal definitions; letrec restriction; modules;
                 mutual recursion; optimization; recursive binding
                 construct; Scheme",
}

Related entries