A Syntactic Theory of Dynamic Binding (1997)

Cached

Download Links

by Luc Moreau
Venue:Higher-Order and Symbolic Computation
Citations:32 - 1 self

Documents Related by Co-Citation

31 Delimited Dynamic Binding – Oleg Kiselyov, Chung-chieh Shan , Amr Sabry - 2006
81 Implicit parameters: dynamic scoping with static types – Jeffrey R. Lewis, Mark B. Shields, Erik Meijert, John Launchbury - 2000
255 The Revised Report on the Syntactic Theories of Sequential Control and State – Matthias Felleisen, Matthias Felleisen, Robert Hieb, Robert Hieb - 1992
130 Representing Monads – Andrzej Filinski - 1994
61 A Generalization of Exceptions and Control in ML-like Languages – Carl A. Gunter, Didier Rémy, Jon G. Riecke - 1995
65 Language constructs for context-oriented programming – Pascal Costanza - 2005
9 A Calculus of Evolving Objects ⋆ – Mariangiola Dezani-ciancaglini, Paola Giannini, Oscar Nierstrasz
702 Types and programming languages – Benjamin C Pierce - 2002
300 Definitional interpreters for higher-order programming languages – John C. Reynolds - 1972
27 A Lambda-Calculus for Dynamic Binding – Laurent Dami - 1997
55 Representing Layered Monads – Andrzej Filinski - 1999
150 The theory and practice of first-class prompts – M Felleisen - 1988
333 The mechanical evaluation of expressions – P J Landin - 1964
44 Control operators, the secd machine, and the lambda-calculus. Pages 193–217 of: Formal description of programming concepts-iii – M Felleisen, D Friedman - 1986
66 A Functional Abstraction of Typed Contexts – Olivier Danvy, Andrzej Filinski - 1989
42 Type-Based Hot Swapping of Running Modules – Dominic Duggan - 2001
187 Dynamic Software Updating – Michael Hicks - 2001
41 The calculi of λv-CS conversion: A syntactic theory of control and state in imperative higher-order programming languages – M Felleisen - 1987
186 Parameter-Passing and the Lambda Calculus – Erik Crank, Matthias Felleisen - 1991