Sciweavers

659 search results - page 1 / 132
» Binding as sets of scopes
Sort
View
POPL
1993
ACM
13 years 9 months ago
Quasi-Static Scoping: Sharing Variable Bindings Across Multiple Lexical Scopes
Static scoping embodies a strong encapsulation mechanism for hiding the details of program units. Yet, it does not allow the sharing of variable bindings locations across indepe...
Shinn-Der Lee, Daniel P. Friedman
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 5 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
ICFP
2001
ACM
14 years 4 months ago
Down with Emacs Lisp: Dynamic Scope Analysis
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 ...
Matthias Neubauer, Michael Sperber
EDOC
2003
IEEE
13 years 10 months ago
An Extensible Binding Framework for Component-Based Middleware
One of the most significant limitations of current middleware platforms, both commercial and research, is that they typically support only a small, pre-defined, set of fundamental...
Nikos Parlavantzas, Geoff Coulson, Gordon S. Blair
TGC
2005
Springer
13 years 10 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...