Help us understand the problem. What is going on with this article?

Implementing functional languages を頑張って読む.10日目

More than 3 years have passed since last update.

10日目

2.2

state transition system,状態遷移系を使ってグラフ簡約をする.
ステートマシンの説明ばっか.

2.3

template instantiation graph reduction machine の初期状態は (stack, dump, heap, globals)
stackaddresses用で,それぞれのアドレスはヒープにあるnodeを指す.
それらのノードは評価されなければならない式である.
a1:sという表記はスタックトップはa1,残りはs,という意味.
dumpはMark1では使わないけど後で使う
heapはnodeを格納している.
h[a : node]という表記はヒープhのアドレスaはノードnodeを参照していることを表す.
globalはscを表しているheap nodeのアドレスが入る

heap nodeは以下のようになる
NAp a1 a2 はa2をa1に適用,
NSupercomb args body はsupercombinator
NNum n は数字
NScじゃダメだったのだろうか

わからん

the global mapping of names to heap addresses, f , augmented by the mapping of argument
names to their addresses obtained from the stack.

(2.1),(2.2)で簡約できるらしい.本当か?

時間がなくてあまり読めなかった.2.3.1までしか読んでない

amama
Why not register and get more from Qiita?
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away
Comments
No comments
Sign up for free and join this conversation.
If you already have a Qiita account
Why do not you register as a user and use Qiita more conveniently?
You need to log in to use this function. Qiita can be used more conveniently after logging in.
You seem to be reading articles frequently this month. Qiita can be used more conveniently after logging in.
  1. We will deliver articles that match you
    By following users and tags, you can catch up information on technical fields that you are interested in as a whole
  2. you can read useful information later efficiently
    By "stocking" the articles you like, you can search right away
ユーザーは見つかりませんでした