Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Journal Article
%1 citeulike:499736
%A McCarthy, John
%C New York
%D 1960
%I ACM
%J Communications of the ACM
%K 68n20-compilers-and-interpreters
%N 4
%P 184--195
%R 10.1145/367177.367199
%T Recursive Functions of Symbolic Expressions and their Computation by Machine, Part I
%U http://dx.doi.org/10.1145/367177.367199
%V 3
%X An abstract is not available.
@article{citeulike:499736,
abstract = {{An abstract is not available.}},
added-at = {2017-06-29T07:13:07.000+0200},
address = {New York},
author = {McCarthy, John},
biburl = {https://www.bibsonomy.org/bibtex/29ad0fe9c43ae06b3532d9fa348bc3c05/gdmcbain},
citeulike-article-id = {499736},
citeulike-attachment-1 = {mccarthy_60_recursive.pdf; /pdf/user/gdmcbain/article/499736/695597/mccarthy_60_recursive.pdf; 69a6487571b624e9d4f029f73ad441cf6eb7d270},
citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=367177.367199},
citeulike-linkout-1 = {http://dx.doi.org/10.1145/367177.367199},
comment = {(private-note)cited by Wikipedia `Just-in-time compilation' for mentions of the first implementations of that approach, in Lisp interpreters},
day = 1,
doi = {10.1145/367177.367199},
file = {mccarthy_60_recursive.pdf},
interhash = {ff2455577b17cfd1f12698db7f8ec827},
intrahash = {9ad0fe9c43ae06b3532d9fa348bc3c05},
issn = {0001-0782},
journal = {Communications of the ACM},
keywords = {68n20-compilers-and-interpreters},
month = apr,
number = 4,
pages = {184--195},
posted-at = {2011-09-04 08:30:17},
priority = {2},
publisher = {ACM},
timestamp = {2017-06-29T07:13:07.000+0200},
title = {Recursive Functions of Symbolic Expressions and their Computation by Machine, {P}art {I}},
url = {http://dx.doi.org/10.1145/367177.367199},
volume = 3,
year = 1960
}