(Enter summary)
Abstract: It is possible to translate code written in Emacs Lisp or another
Lisp dialect which uses dynamic scoping to a more
modern programming language with lexical scoping while
largely preserving structure and readability of the code. The
biggest obstacle to such an idiomatic translation from Emacs
Lisp is the translation of dynamic binding into suitable instances
of lexical binding: Many binding constructs in real
programs in fact exhibit identical behavior under both dynamic
and lexical binding. An ... (Update)
Cited by: More
C∀, a Study in Evolutionary Design in Programming Languages - Jaramillo (2004)
(Correct)
Active bibliography (related documents): More All
0.5: Kripke-Style Models for Typed Lambda Calculus - Mitchell, Moggi (1996)
(Correct)
0.2: Dynamic Rebinding for Marshalling and Update, with .. - Bierman, Hicks.. (2004)
(Correct)
0.2: Dynamic Rebinding for Marshalling and Update, with.. - Bierman, Hicks.. (2003)
(Correct)
Similar documents based on text: More All
0.6: Distel: Distributed Emacs Lisp (for Erlang) - Gorrie (2002)
(Correct)
0.4: A Syntactic Theory of Dynamic Binding - Moreau (1997)
(Correct)
0.3: Emacs Lisp in Edwin Scheme - Birkholz (1993)
(Correct)
BibTeX entry: (Update)
Matthias Neubauer and Michael Sperber. Down with Emacs Lisp: dynamic scope analysis. In Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, pages 38-49, 2001. http://citeseer.ist.psu.edu/neubauer01down.html More
@inproceedings{ neubauer01down,
author = "Matthias Neubauer and Michael Sperber",
title = "Down with Emacs Lisp: Dynamic Scope Analysis",
booktitle = "International Conference on Functional Programming",
pages = "38-49",
year = "2001",
url = "citeseer.ist.psu.edu/neubauer01down.html" }
Citations (may not include all citations):
906
A structural approach to operational semantics
- Plotkin - 1981
306
A syntactic approach to type soundness
- Wright, Felleisen - 1991
306
A syntactic approach to type soundness
- Wright, Felleisen - 1994
259
Combinatory Logic (context) - Curry, Feys - 1958
187
Type inclusion constraints and type inference
- Aiken, Wimmers - 1993
176
Control-Flow Analysis of Higher-Order Languages (context) - Shivers - 1991
165
Set-based analysis of ML programs (context) - Heintze - 1994
77
Co-induction in relational semantics (context) - Milner, Tofte - 1991
76
Control operators (context) - Felleisen, Friedman - 1986
55
A Unified Treatment of Flow Analysis in Higher-Order Languag..
- Jagannathan, Weeks - 1995
50
Programming Language Theory and its Implementation (context) - Gordon - 1988
46
Infinitary control flow analysis: a collecting semantics for..
- Nielson, Nielson - 1997
43
A tractable Scheme implementation
- Kelsey, Rees - 1995
35
Implicit parameters: Dynamic scoping with static types
- Lewis, Shields et al. - 2000
27
An interpretation of Standard ML in type theory
- Harper, Stone - 1997
23
Set-based analysis for full scheme and its use in soft-typin..
- Flanagan, Felleisen - 1995
22
Storage use analysis and its applications
- Serrano, Feeley - 1996
17
Lisp in Small Pieces (context) - Queinnec - 1996
12
ACM Transactions on Programming Languages and Systems (context) - Wright, Jagannathan et al. - 1998
12
ACM Transactions on Programming Languages and Systems (context) - Flanagan, Felleisen et al. - 1999
5
Higher-Order and Symbolic Computation (context) - Moreau, Theory et al. - 1998
2
Introduction or Combinators and Lambda Calculus (context) - Hindley, Seldin - 1986
1
Lecture Notes in Computer Science (context) - Aiken, Results et al. - 1994
1
Guile-based Emacs (context) - Raeburn - 1999
1
Dynamic scope analysis for Emacs Lisp (context) - Neubauer - 2000
1
JEmac javascheme based emac
- the, based et al. - 2000
1
JEmac JavaScheme based Emac text editor (context) - the, based et al. - 2001
1
Abstact types have existantial type (context) - Mitchell, Plotkin - 1988
1
GNU extension language plans (context) - Stallman - 1994
1
XEmacs Lisp Reference Manual (context) - Wing - 1999
http://www.gnu.org/manual/elisp-manual-20-2.5/
Documents on the same site (http://www.informatik.uni-freiburg.de/~neubauer/): More
Functional Logic Overloading - Neubauer, Thiemann, Gasbichler.. (2001)
(Correct)
Preliminary Proceedings of the ACM SIGPLAN Haskell Workshop.. - (editor) (2001)
(Correct)
Type Classes With More Higher-Order Polymorphism - Neubauer, Thiemann (2002)
(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