|
JAIST Repository >
School of Information Science >
JAIST Research Reports >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2006 >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/8409
|
| Title: | Normalization by stack-based evaluation |
| Authors: | Vestergaard, Rene |
| Issue Date: | 2006-07-07 |
| Publisher: | 北陸先端科学技術大学院大学情報科学研究科 |
| Magazine name: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| Volume: | IS-RR-2006-010 |
| Start page: | 1 |
| End page: | 36 |
| Abstract: | We introduce Normalisation by Stack-based Evaluation, NbSE, combining Normalisation by Evaluation, NbE, with stack-based evaluation a la ZINC and Krivine's Machine. Stack-based evaluation avoids building, returning, and unpacking some of the closures (i.e., code, environment pairs) that evaluation uses internally as primitives. NbE makes evaluation two-sorted and invokes sort-coercers, called reify and reflect, in order to eliminate (external) closures from the domain of yielded values. We show that their combination, NbSE, can be implemented entirely without closures for both the call-by-name and call-by-value paradigms. The call-by-value implementation is more aggressive than usual in that it fully normalises argument terms before passing them on. The technical development in the paper establishes a conservative-extension hierarchy of the considered evaluation mechanisms that focuses on type soundness and its correctness consequences; this includes the various NbE/NbSE theorems. |
| URI: | https://hdl.handle.net/10119/8409 |
| Material Type: | publisher |
| Appears in Collections: | IS-RR-2006
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| IS-RR-2006-010.pdf | | 1456Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
