Luc Moreau  Home/Search
Context Related
| ecs.soton.ac.uk/~lavm/paper...dyn.ps.gz para.inria.fr/~lef...00041Mor96b.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: staff.ecs.soton.ac.uk/~l...papers (more) From: para.inria.fr/~lefessan/b...publi (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Dynamic binding, which traditionally has always been associated with Lisp, is still semantically obscure to many. Even though most programming languages favour lexical scope, not only does dynamic binding remain an interesting and expressive programming technique in specialised circumstances, but also it is a key notion in formal semantics. This article presents a syntactic theory that enables the programmer to perform equational reasoning on programs using dynamic binding. The theory is... (Update)
Context of citations to this paper: More
.... 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...
.... 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...
Cited by: More
Task System and Item Architecture (TSIA) - Steinmacher-Burow (1999) (Correct)
A Syntactic Theory of Dynamic Binding - Moreau (1996) (Correct)
Advanced Programming Techniques Using Scheme - Moreau, Ribbens, Gribomont (1998) (Correct)
Active bibliography (related documents): More All
0.6: The Semantics of Pcall and Fork in the Presence of.. - Moreau, Ribbens (1995) (Correct)
0.6: On the Finiteness of Resources in Distributed Computing - Moreau, Queinnec (1997) (Correct)
0.5: Correctness of a Distributed-Memory Model for Scheme - Moreau (1996) (Correct)
Similar documents based on text: More All
0.4: Functional Programming with Dynamic Binding - Dami (1996) (Correct)
0.3: Down with Emacs Lisp: Dynamic Scope Analysis - Neubauer, Sperber (2001) (Correct)
0.3: Compact Dispatch Tables for Dynamically Typed Object Oriented .. - Vitek, Horspool (Correct)
Related documents from co-citation: More All
3: New Ideas in Parallel Lisp : Language Design (context) - Halstead - 1990
3: The function of FUNCTION in LISP or why the FUNARG problem should be called the .. (context) - Moses - 1970
3: Revised 4 Report on the Algorithmic Language Scheme - Rees, Clinger - 1991
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/moreau96syntactic.html More
@inproceedings{ luc97syntactic,
author = "Moreau, Luc",
title = "{A} {S}yntactic {T}heory of {D}ynamic {B}inding",
booktitle = "International Joint Conference on Theory and Practice of Software Development ({TAPSOFT}/{FASE}'97)",
volume = "1214",
month = "apr",
publisher = "Springer-Verlag",
address = "Lille, France",
pages = "727--741",
year = "1997",
url = "citeseer.ist.psu.edu/moreau96syntactic.html" }
Citations (may not include all citations):1074 The Definition of Standard ML (context) - Milner, Tofte et al. - 1990
862 The Java Language Specification - Gosling, Steele et al. - 1996
729 The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1984
346 Denotational Semantics : The Scott-Strachey Approach to Prog.. (context) - Stoy - 1977
283 Theoretical Computer Science (context) - Plotkin, Call-by-Value et al. - 1975
257 Report on the Programming Language Haskell (context) - Hudak, Jones et al. - 1991
197 Revised 4 Report on the Algorithmic Language Scheme - Rees, Clinger - 1991
173 Lazy Task Creation : a Technique for Increasing the Granular.. - Mohr, Kranz et al. - 1990
158 Reasoning about Programs in Continuation-Passing Style - Sabry, Felleisen - 1993
139 Recursive Functions of Symbolic Expressions and Their Comput.. - McCarthy - 1960
84 The Denotational Description of Programming Languages (context) - Gordon - 1970
75 A Syntactic Theory of Sequential Control (context) - Felleisen, Friedman et al. - 1987
66 Abstracting Control - Danvy, Filinski - 1990
51 the Expressive Power of Programming Languages - Felleisen - 1990
50 Programming Language Theory and its Implementation (context) - Gordon - 1988
39 Massachusetts Institute of Technology (context) - Steele, Rabbit et al. - 1978
37 Back to Direct Style II: First-Class Continuations - Danvy, Lawall - 1992
35 Continuations and Concurrency (context) - Hieb, Dybvig - 1990
32 Speculative Computation in Multilisp (context) - Osborne - 1990
30 A Syntactic Theory of Sequential State (context) - Felleisen, Friedman - 1989
27 Lisp and Symbolic Computation (context) - Sitaram, Felleisen et al. - 1990
27 second edition (context) - Steele, Lisp et al. - 1990
25 New Ideas in Parallel Lisp : Language Design (context) - Halstead - 1990
24 A Dynamic Extent Control Operator for Partial Continuations - Queinnec, Serpette - 1991
23 An Efficient and General Implementation of Futures on Large .. - Feeley - 1993
22 A Lambda-Calculus for Dynamic Binding - Dami
22 the SECD-Machine and the -Calculus (context) - Felleisen, Friedman - 1986
20 School of Computer Science (context) - Filinski, PhD - 1996
18 The Function of FUNCTION in Lisp or Why the FUNARG Problem S.. (context) - Moses - 1970
18 A Parallel Lisp Language Pailisp and its Kernel Specificatio.. (context) - Ito, Matsui - 1990
18 History of Lisp - McCarthy - 1978
17 Design of a Concurrent and Distributed Language - Queinnec, DeRoure - 1992
17 Lisp in Small Pieces (context) - Queinnec - 1996
15 Reasoning about Explicit and Implicit Representations of Sta.. - Sabry, Field - 1993
15 Shallow Binding in LISP - Baker - 1978
14 The Semantics of Scheme with Future - Moreau - 1996
12 Bash Reference Manual (context) - Ramey, Fox - 1996
12 A Reduction Semantics for Imperative HigherOrder Languages (context) - Felleisen, Friedman - 1987
11 Isolating Side Effects in Sequential Languages - Riecke, Viswanathan - 1995
10 Haynes and Daniel P (context) - Christopher - 1987
9 The Formal Relationship between Direct and Continuation-Pass.. - Sabry - 1994
8 Draft Standard for Information Technology -- Portable Operat.. (context) - IEEE - 1994
7 Massachusetts Institute of Technology (context) - Hanson, Reference - 1991
6 ege, Service d (context) - Moreau, of et al. - 1994
4 A Syntactic Theory of Dynamic Binding - Moreau
4 A Syntactic Theory of Dynamic Binding - Moreau - 1997
4 Mc Graw Hill (context) - Allen, Lisp - 1979
4 Towards a Semantic Theory of Dynamic Binding (context) - Gordon - 1975
3 A Natural Semantics of Eiffel Dynamic Binding - Attali, Caromel et al. - 1996
3 ese d"etat, Universit (context) - Greussay, D'efinition et al. - 1977
3 Technical Issues of Separation in Function Cells and Value C.. (context) - Gabriel, Pitman - 1988
2 Julian Padget and Grep Nuyens (context) - Padget, Editors et al. - 1991
2 A Generalization of Exceptions and Control in ML (context) - Gunter, R'emy et al. - 1995
2 Dynamic Identifiers Can Be Neat (context) - Duba, Felleisen et al. - 1987
2 GNU Emacs Lisp Reference Manual (context) - Krawitz, Lewis et al.
2 Operational Reasoning and Denotational Semantics (context) - Gordon - 1975
2 Lambda: the Ultimate Combinator (context) - Cartwright - 1991
1 Maclisp reference maunal (context) - Moon - 1974
1 Maintaining Dynamic States: Deep (context) - Haynes, Salter
1 Computation Applications of Calculi Based on Monads (context) - Cenciarelli - 1995
1 Received Date Accepted Date Final Manuscript Date (context) - Wall, Christiansen et al. - 1996
Documents on the same site (http://www.staff.ecs.soton.ac.uk/~lavm/papers.html): More
Advanced Programming Techniques Using Scheme - Moreau, Ribbens, Gribomont (1998) (Correct)
Design and Semantics of Quantum: a Language to Control.. - Moreau, Queinnec (1997) (Correct)
Correctness of a Distributed-Memory Model for Scheme - Moreau (1996) (Correct)
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