کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
423642 685267 2008 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Minimality in a Linear Calculus with Iteration
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Minimality in a Linear Calculus with Iteration
چکیده انگلیسی

System L is a linear version of Gödel's System T, where the λ-calculus is replaced with a linear calculus; or alternatively a linear λ-calculus enriched with some constructs including an iterator. There is thus at the same time in this system a lot of freedom in reduction and a lot of information about resources, which makes it an ideal framework to start a fresh attempt at studying reduction strategies in λ-calculi. In particular, we show that call-by-need, the standard strategy of functional languages, can be defined directly and effectively in System L, and can be shown minimal among weak strategies.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 204, 4 April 2008, Pages 163-179