Filters








757 Hits in 5.2 sec

Quasi-static scoping

Shinn-Der Lee, Daniel P. Friedman
1993 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93  
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 independent program units.  ...  The user can control when and in what scope to resolve a quasi-at atic variable, i.e., to associate it with a variable binding.  ...  On the other hand, it reduces every quasi-static variable reference's quasi-static variable referencing. 6 Comparisons and Future Work We accomplish variable sharing across lexical scopes  ... 
doi:10.1145/158511.158706 dblp:conf/popl/LeeF93 fatcat:m3msnx4fnfcinlseouxoqb4ehm

Template meta-programming for Haskell

Tim Sheard, Simon Peyton Jones
2002 SIGPLAN notices  
These occurrences are within the static scope of their binding occurrence: static scoping extends across the template mechanism.  ...  To summarize, lexical scoping means that the free variables (such as swap and x) of a top-level quasi-quote (such as the right hand side of the definition of genSwap) are statically bound to the closure  ... 
doi:10.1145/636517.636528 fatcat:euqngdkb2nfyhfjut6xewzenwi

Template meta-programming for Haskell

Tim Sheard, Simon Peyton Jones
2002 Proceedings of the ACM SIGPLAN workshop on Haskell - Haskell '02  
These occurrences are within the static scope of their binding occurrence: static scoping extends across the template mechanism.  ...  To summarize, lexical scoping means that the free variables (such as swap and x) of a top-level quasi-quote (such as the right hand side of the definition of genSwap) are statically bound to the closure  ... 
doi:10.1145/581690.581691 fatcat:j4tkdi6rvfaepiwuddu2jydlkq

Meta C++: an extension layer for multi-stage generative metaprogramming

Yannis Lilis, Anthony Savidis
2019 Journal of Object Technology  
The C Preprocessor is inadequate for metaprogramming as it operates at a lexical level.  ...  To better illustrate this notion consider the following Lisp macro that generates the multiplication of the argument X by itself.  ...  In our language, unbound variable within quasi-quotes are resolved in the context where the quoted code will actually be inserted, offering no name binding guaranties and involving no scope extrusion issue  ... 
doi:10.5381/jot.2019.18.1.a1 fatcat:xnpvksx3frakdhlrtecfjya774

Experience with an uncommon Lisp

Cyril N. Alberga, Chris Bosman-Clark, Martin Mikelsons, Mary S. Van Deusen, Julian Padget
1986 Proceedings of the 1986 ACM conference on LISP and functional programming - LFP '86  
The Lisp language issues discussed include scoping, operator evaluation and consistency, and state saving.  ...  Lisp 1.5 and descendents such as MACLISP used pure dynamic scoping in the interpreter and a form of static scoping, modified by dynamic (or special) variables, in the compiler.  ...  The rules we chose provided lexical scoping as a default, with dynamic (FLUID variables) as an option.  ... 
doi:10.1145/319838.319849 fatcat:c22nekuodresblxgqojtrbvuom

Eval begone!

Fadi Meawad, Gregor Richards, Floréal Morandat, Jan Vitek
2012 SIGPLAN notices  
Consider the following JavaScript expression: eval ( x ) Depending on the value bound to variable x, the state of any heap-allocated mutable value and the bindings of local variables in scope can be modified  ...  When eval is called directly, the code is evaluated within the enclosing lexical scope.  ... 
doi:10.1145/2398857.2384660 fatcat:lmyb4cpt4zhz7bs6vczwjogx6m

Eval begone!

Fadi Meawad, Gregor Richards, Floréal Morandat, Jan Vitek
2012 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '12  
Consider the following JavaScript expression: eval ( x ) Depending on the value bound to variable x, the state of any heap-allocated mutable value and the bindings of local variables in scope can be modified  ...  When eval is called directly, the code is evaluated within the enclosing lexical scope.  ... 
doi:10.1145/2384616.2384660 dblp:conf/oopsla/MeawadRMV12 fatcat:fqi3qbfovba33f44b5bkvyvsva

Embedded parser generators

Jonas Duregård, Patrik Jansson
2011 Proceedings of the 4th ACM symposium on Haskell - Haskell '11  
Embedding is carried out by means of quasi-quotation enabling use of the languages concrete syntax inside Haskell code.  ...  Since multiple quoters can be in scope at any given quotation site, each quote is labelled with the name of the quasi-quoter to use.  ...  Each case binds the component values of the matching constructor to variables.  ... 
doi:10.1145/2034675.2034689 dblp:conf/haskell/DuregardJ11 fatcat:cfyn7dcfnjbitirz3ofmik22lu

Embedded parser generators

Jonas Duregård, Patrik Jansson
2012 SIGPLAN notices  
Embedding is carried out by means of quasi-quotation enabling use of the languages concrete syntax inside Haskell code.  ...  Since multiple quoters can be in scope at any given quotation site, each quote is labelled with the name of the quasi-quoter to use.  ...  Each case binds the component values of the matching constructor to variables.  ... 
doi:10.1145/2096148.2034689 fatcat:yfziky2dafh7bfmser7apt36qa

Incremental quantification and the dynamics of pair-list phenomena

Dylan Bumford
2015 Semantics and Pragmatics  
universals are unique among natural language quantifiers in the following three ways: (i) matrix interrogatives that contain them accept pair-list answers; (ii) indefinites and disjunctions in their scope  ...  Periods separate variable-binding operators from the expressions they scope over, and have lower precedence than everything except for braces and slashes.  ...  Charlow's grammar provides a nice interface between dynamic binding and exceptional scope-taking.  ... 
doi:10.3765/sp.8.9 fatcat:bkrxo3xax5bqld2dxmrzankw4a

Staged metaprogramming for shader system development

Kerry A. Seitz, Tim Foley, Serban D. Porumbescu, John D. Owens
2019 ACM Transactions on Graphics  
In our system, shader and application code are written in the same language and can share types and functions.  ...  We implement a design space exploration framework for Selos that investigates static versus dynamic composition of shader features, exploring the impact of shader specialization in a deferred renderer.  ...  capture issues, quasi-quoted code is hygienic and lexically scoped by default [Bawden and Rees 1988] .  ... 
doi:10.1145/3355089.3356554 fatcat:5632ra7n6jgexjedl3zru42kte

The history of Standard ML

David MacQueen, Robert Harper, John Reppy
2020 Proceedings of the ACM on Programming Languages (PACMPL)  
ML is the foremost exemplar of a functional programming language with strict evaluation (call-by-value) and static typing.  ...  Lisp was a functional language that could manipulate functions as data, although its behavior as a functional language was flawed by the use of dynamic binding.  ...  in the scope of the binding. let x = e 1 in e 2 → [e 2 /x]e 1 Multiple occurrences of x in e 2 are replaced by multiple copies of the expression e 1 .  ... 
doi:10.1145/3386336 fatcat:2hrtsaf5azfe3htngsqvxv3kre

Typeful Programming

Luca Cardelli
1989 Central and East European Conference on Software Engineering Techniques  
is achieved by let rec followed by multiple bindings separated by and.  ...  The scope of typeful programming would also have another major limitation if we required programs to be completely statically typed.  ...  Syntax Signatures (S): Types and operators (A,B,C; type identifiers X,Y,Z): Here we use the construct "bind S = a in b" which binds the components of the tuple "a" to the identifiers in "S" in the scope  ... 
dblp:conf/ifip2/Cardelli89 fatcat:atscrybgtzcd7oygpsyerrsg64

The Notion of Dynamic Unit: Conceptual Developments in Cognitive Science

Nili Mandelblit, Oron Zachar
1998 Cognitive Science  
Our framework suggests a definition of unity which is based on dynamic patterns of correlation across the elements constituting the unit (rather than on inherent properties of the constituting elements  ...  Alternative Solutions: Dynamic Binding of Distributed Information in the Brain Alternative solutions to the binding problem look for dynamic rather than static (local) binding of distributed information  ...  In light of the given data in Hungarian, Ackerman & LeSourd propose to restrict the scope of the lexical integrity hypothesis, allowing lexical representation to be expressed by pieces that are separate  ... 
doi:10.1207/s15516709cog2202_3 fatcat:fcrj4fxsavbgpgszq5l7erxyhu

A first-class approach to genericity

Eric Allen, Jonathan Bannet, Robert Cartwright
2003 SIGPLAN notices  
abstract In the JSR-14 extension of Java, a static field of generic class is shared across all instantiations of the class [15] .  ...  A.7.5 Scopes and Entries Each Scope is owned by a Symbol corresponding to the lexical environment the Scope represents.  ...  All subclasses are static nested classes of class Symbol. The composite hierarchy is represented in BNF notation in Figure A Each ClassSymbol contains a Scope of its members.  ... 
doi:10.1145/949343.949316 fatcat:smt7i5dwlfchlpmajoqsnq7aby
« Previous Showing results 1 — 15 out of 757 results