Changes between Version 33 and Version 34 of ExplicitCallStack

Timestamp:

01/30/07 06:09:29 (6 years ago)

Author:

guest

Comment:

--

ExplicitCallStack

@@ -124 +124 @@
 === Transformation option 1 ===
 
-This is probably the simplest transformation style possible. Stack traces are passed to functions at their lexical call sites, which correspond to the places where the function is mentioned in the source code. CAF bindings are treated as roots of stacks, so only function bindings receive stack arguments. In this transformation we can get away with simply passing one stack argument for each function, regardless of how many regular arguments it has. In contrast, other transformation styles
+This is probably the simplest transformation style possible. Stack traces are passed to (let bound) functions at their lexical call sites, which correspond to the places where the function is mentioned in the source code. CAF bindings are treated as roots of stacks, so only function bindings receive stack arguments. In this transformation we can get away with simply passing one stack argument for each function, regardless of how many regular arguments it has. In contrast, other transformation styles
 might pass one stack argument for every regular argument of the function.