|
JAIST Repository >
b. 情報科学研究科・情報科学系 >
b30. リサーチレポート >
Research Report - School of Information Science ： ISSN 0918-7553 >
IS-RR-2006 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10119/8409
|
| タイトル: | Normalization by stack-based evaluation |
| 著者: | Vestergaard, Rene |
| 発行日: | 2006-07-07 |
| 出版者: | 北陸先端科学技術大学院大学情報科学研究科 |
| 誌名: | Research report (School of Information Science, Japan Advanced Institute of Science and Technology) |
| 巻: | IS-RR-2006-010 |
| 開始ページ: | 1 |
| 終了ページ: | 36 |
| 抄録: | 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: | http://hdl.handle.net/10119/8409 |
| 資料タイプ: | publisher |
| 出現コレクション: | IS-RR-2006
|
このアイテムのファイル:
| ファイル |
記述 |
サイズ | 形式 |
|---|
| IS-RR-2006-010.pdf | | 1456Kb | Adobe PDF | 見る/開く |
|
当システムに保管されているアイテムはすべて著作権により保護されています。
|
