Commit a4b9a344 authored by Kim Nguyễn's avatar Kim Nguyễn
Browse files

Put appropriate answer.

parent 39d1d5f1
......@@ -758,7 +758,13 @@ the new contributions.
corresponds to one pass on the function for each arrow in the
Likewise ... TO BE CONTINUED BY KIM (fixpoint, memoization ...).
Likewise, the value of the $n_o$ parameter obviously impact the
number of passes our algorithm performs. We have improved our
explanation, saying that a value of $n_o = 1$ is sufficient for
all our examples. Last, instead of a naive implementation of environment
(indexed by expressions, instead of variables), we use an
optimized one where expressions are memoized during parsing so has
to perform constant time look-up in this environment.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment