Luc Moreau. "A Syntactic Theory of Dynamic Binding", International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97), Lecture Notes in Computer Science, Vol. 1214, pp. 727-741, Springer-Verlag, April 1997. (Available at http://www.ecs.soton.ac.uk/~lavm/papers/tapsoft97.ps.gz).  Home/Search   Document Details and Download   Summary   Related Articles   Check

....nonlocal use of the down item d within the block refers to a copy of the item d in the remaining code of the routine f. A down item obeys an aspect of the behavior of some variables in the Lisp family of languages [FUNARG] IMPERATIVE] Similar examples of this behavior also are found elsewhere [Dynamic Binding] For example, in the UNIX operating system, a child process receives a copy of its environment variables from its parent. Variables and environment variables of a UNIX shell thus are similar to local items and down nonlocal items, respectively. A down nonlocal item has practical uses not ....

Luc Moreau. "A Syntactic Theory of Dynamic Binding", International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97), Lecture Notes in Computer Science, Vol. 1214, pp. 727-741, Springer-Verlag, April 1997. (Available at http://www.ecs.soton.ac.uk/~lavm/papers/tapsoft97.ps.gz).

....statically scoped. According to lexical scope, a variable in an expression refers to the innermost lexically enclosing construct declaring that variable. This rule implies that nested declarations follow This technical report is an extension of a paper published in Lisp and Symbolic Computation [46]; it contains some of the proofs or cases that did not appear in the journal version. 2 a block structure organisation. Variables following the lexical scope rule are said to be lexically scoped variables or lexical variables. On the contrary, if the scope of a name cannot be determined ....

Luc Moreau. A Syntactic Theory of Dynamic Binding. Lisp and Symbolic Computation, Accepted for Publication.

.... (Section 7) On the other hand, we use dynamic binding as a semantic primitive to formalise two different models of exceptions: non resumable exceptions as in ML [40] and resumable ones as in Common Lisp [50, 64] Section 8) This article is an extended version of a preliminary report [45]: it contains the proofs of the different theorems and it describes shallow binding with value cell. Before deriving our calculus, we introduce dynamic binding intuitively, and we further motivate our work by describing three broad categories of use of dynamic binding: conciseness, control ....

Luc Moreau. A Syntactic Theory of Dynamic Binding. In International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97), volume 1214 of Lecture Notes in Computer Science, pages 727--741, Lille, France, April 1997. SpringerVerlag.

....This debugging information is even more helpful if the trace is indented: the expression nesting being represented by its indentation on the screen. We do not show the code in the paper, but it presents an extra difficulty as the indentation level has a dynamic nature (like dynamic binding [16]) and its definition in the presence of first class continuations is an instance of the state space problem [11] Advanced Programming Techniques Using Scheme 3.4. Continuations and State So far, we assumed that the function map was defined as map, but the program would not behave as ....

Luc Moreau. A Syntactic Theory of Dynamic Binding. In International Joint Conference on Theory and Practice of Software Development (TAPSOFT/FASE'97), volume 1214 of Lecture Notes in Computer Science, pages 727--741, Lille, France, April 1997. Springer-Verlag.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC