An abstract machine for Lambda-terms normalization Export

@inproceedings{citeulike:4457187, abstract = {Two abstract machines reducing terms to their full normal form are presented in this paper. They are based on Krivine's abstract machine [Kri85] which uses an environment to store arguments of function calls. A proof of their correctness is then stated in the abstract framework of \&lgr; \&sgr; -calculus [Cur89].}, address = {New York, NY, USA}, author = {Cr\'{e}gut, P.}, booktitle = {LFP '90: Proceedings of the 1990 ACM conference on LISP and functional programming}, citeulike-article-id = {4457187}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=91556.91681}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/91556.91681}, doi = {10.1145/91556.91681}, isbn = {0-89791-368-X}, keywords = {debruijn}, location = {Nice, France}, pages = {333--340}, posted-at = {2009-05-04 09:12:36}, priority = {2}, publisher = {ACM}, title = {An abstract machine for Lambda-terms normalization}, url = {http://dx.doi.org/10.1145/91556.91681}, year = {1990} }

TY - CONF ID - citeulike:4457187 L3 - citeulike-article-id:4457187 N2 - Two abstract machines reducing terms to their full normal form are presented in this paper. They are based on Krivine's abstract machine [Kri85] which uses an environment to store arguments of function calls. A proof of their correctness is then stated in the abstract framework of &lgr; &sgr; -calculus [Cur89]. CY - Nice, France SN - 0-89791-368-X AD - New York, NY, USA EP - 340 TI - An abstract machine for Lambda-terms normalization PB - ACM T2 - LFP '90: Proceedings of the 1990 ACM conference on LISP and functional programming SP - 333 KW - debruijn AU - Cr\'{e}gut, P PY - 1990/// UR - http://dx.doi.org/10.1145/91556.91681 ER -