Last update: Sun Oct 15 02:16:54 MDT 2017
@Article{Lang:2007:ELK,
author = "Fr{\'e}d{\'e}ric Lang",
title = "Explaining the lazy {Krivine} machine using explicit
substitution and addresses",
journal = j-HIGHER-ORDER-SYMB-COMPUT,
volume = "20",
number = "3",
pages = "257--270",
month = sep,
year = "2007",
CODEN = "LSCOEX",
DOI = "https://doi.org/10.1007/s10990-007-9013-1",
ISSN = "1388-3690 (print), 2212-0793 (electronic)",
ISSN-L = "1388-3690",
bibdate = "Wed Jul 9 12:34:45 MDT 2008",
bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=1388-3690&volume=20&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=20&issue=3&spage=257",
acknowledgement = ack-nhfb,
journal-URL = "http://link.springer.com/journal/10990",
keywords = "Abstract machine; Call-by-need; Functional
programming; Lazy evaluation",
}