Name Binding (researchr/bibliography/publications)

researchr

You are not signed in
Sign in
Sign up

2013

Declarative Name Binding and Scope Rules Gabriël D. P. Konat, Lennart C. L. Kats, Guido Wachsmuth, Eelco Visser. SLE 2012: 311-331 [doi] [classification]

2012

Object Constraint LanguageObject Management Group, 2.3.1, 2012. [classification]

A Language Generic Solution for Name Binding Preservation in RefactoringsMaartje de Jonge, Eelco Visser. LDTA 2012: [doi] [classification]

The Spoofax Name Binding LanguageGabriël D. P. Konat, Vlad A. Vergu, Lennart C. L. Kats, Guido Wachsmuth, Eelco Visser. In Companion to the 27th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2011, part of SPLASH 2012, Tucson, AR, USA, October 19 - 26, 2012. 2012: [classification]

A pure embedding of attribute grammarsAnthony M. Sloane, Lennart C. L. Kats, Eelco Visser. SCP, , 2012. [doi] [classification]

2011

Tutorials and Documentation for Xtext 2.0http://www.eclipse.org/Xtext/documentation/, 2011. [classification]

Lem: A Lightweight Tool for Heavyweight SemanticsScott Owens, Peter Böhm, Francesco Zappa Nardelli, Peter Sewell. itp 2011: 363-369 [doi] [classification]

Integrated symbol table, engine and heap memory management in multi-engine prologPaul Tarau. iwmm 2011: 129-138 [doi] [classification]

2010

Reference Attribute Grammars for Metamodel SemanticsChristoff Bürger, Sven Karol, Christian Wende, Uwe Aßmann. SLE 2010: 22-41 [doi] [classification]

Xtext: implement your language faster than the quick and dirty wayM. Eysholdt, H. Behrens. In Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion. 2010: 307-309 [classification]

The Spoofax language workbench: rules for declarative specification of languages and IDEsLennart C. L. Kats, Eelco Visser. OOPSLA 2010: 444-463 [doi] [classification]

Strong Normalization for System F by HOAS on Top of FOASAndrei Popescu, Elsa L. Gunter, Christopher J. Osborn. lics 2010: 31-40 [doi] [classification]

An overview of the K semantic frameworkGrigore Rosu, Traian-Florin Serbanuta. jlp, 79(6):397-434, 2010. [doi] [classification]

Symbol spotting in vectorized technical drawings through a lookup table of region stringsMarçal Rusiñol, Josep Lladós, Gemma Sánchez. paa, 13(3):321-331, 2010. [doi] [classification]

Silver: An extensible attribute grammar systemEric Van Wyk, Derek Bodin, Jimin Gao, Lijesh Krishnan. SCP, 75(1-2):39-54, 2010. [doi] [classification]

Implementation of a Modelica compiler using JastAdd attribute grammarsJohan Åkesson, Torbjörn Ekman, Görel Hedin. SCP, 75(1-2):21-38, 2010. [doi] [classification]

2009

Scope Dominance with Generalized QuantifiersGilad Ben-Avi, Yoad Winter. birthday 2009: 36-44 [doi] [classification]

Quality of Name Resolution in the Domain Name SystemCasey T. Deccio, Chao-Chih Chen, Jeff Sedayao, Krishna Kant, Prasant Mohapatra. icnp 2009: 113-122 [doi] [classification]

An Introductory Tutorial on JastAdd Attribute GrammarsGörel Hedin. GTTSE 2011: 166-200 [doi] [classification]

Reusable specification modules for type analysisUwe Kastens, William M. Waite. SPE, 39(9):833-864, 2009. [doi] [classification]

Decorated Attribute Grammars: Attribute Evaluation Meets Strategic ProgrammingLennart C. L. Kats, Anthony M. Sloane, Eelco Visser. CC 2009: 142-157 [doi] [classification]

Formalising and Verifying Reference Attribute Grammars in CoqMax Schäfer, Torbjörn Ekman, Oege de Moor. ESOP 2009: 143-159 [doi] [classification]

2008

2007

The JastAdd system - modular extensible compiler constructionTorbjörn Ekman, Görel Hedin. SCP, 69(1-3):14-26, 2007. [doi] [classification]

The JastAdd extensible Java compilerTorbjörn Ekman, Görel Hedin. OOPSLA 2007: 1-18 [doi] [classification]

Typical: Taking the Tedium Out of TypingRobert Grimm, Laune Harris, Anh Le. NYU CS Technical Report TR2007-904, 2007. [classification]

Static Name Control for FreshMLFrançois Pottier. lics 2007: 356-365 [doi] [classification]

2006

Standard ECMA-334 C# Language Specification 4th edition2006. [classification]

Program Transformation with Scoped Dynamic Rewrite RulesMartin Bravenboer, Arthur van Dam, Karina Olmos, Eelco Visser. FUIN, 69(1-2):123-178, 2006. [doi] [classification]

Ruler: Programming Type RulesAtze Dijkstra, S. Doaitse Swierstra. FLOPS 2006: 30-46 [doi] [classification]

oAW xText: A framework for textual DSLsSven Efftinge, Markus Völter. In Workshop on Modeling Symposium at Eclipse Summit. 2006: [classification]

Modular Name Analysis for Java Using JastAddTorbjörn Ekman, Görel Hedin. GTTSE 2006: 422-436 [doi] [classification]

Dynamic Binding Is the Name of the GameMarco Antonio Gómez-Martín, Pedro Pablo Gómez-Martín, Pedro A. González-Calero. iwec 2006: 229-232 [doi] [classification]

Mechanized meta-reasoning using a hybrid HOAS/de bruijn representation and reflectionJason Hickey, Aleksey Nogin, Xin Yu, Alexei Kopylov. ICFP 2006: 172-183 [doi] [classification]

An Overview of C::::alpha::::mlFrançois Pottier. ENTCS, 148(2):27-52, 2006. [doi] [classification]

Visualizing the symbol tableJaime Urquiza-Fuentes, Micael Gallego-Carrillo, Francisco Gortázar-Bellas, J. Ángel Velázquez-Iturbide. iticse 2006: 341 [doi] [classification]

2005

A General Name Binding MechanismMichele Boreale, Maria Grazia Buscemi, Ugo Montanari. tgc 2005: 61-74 [doi] [classification]

Eclipse Support for Using Eli and Teaching Programming LanguagesAnthony M. Sloane, William M. Waite. ENTCS, 141(4):189-194, 2005. [doi] [classification]

2004

Human Usable Textual Notation SpecificationObject Management Group, 2004. [classification]

A Fresh Calculus for Name ManagementDavide Ancona, Eugenio Moggi. GPCE 2004: 206-224 [doi] [classification]

Typing Haskell with an Attribute GrammarAtze Dijkstra, S. Doaitse Swierstra. afp 2005: 1-72 [doi] [classification]

Rewritable Reference Attributed GrammarsTorbjörn Ekman, Görel Hedin. ECOOP 2004: 144-169 [doi] [classification]

Grammatical FrameworkAarne Ranta. JFP, 14(2):145-189, 2004. [doi] [classification]

2003

A framework for typed HOAS and semanticsMarino Miculan, Ivan Scagnetto. ppdp 2003: 184-194 [doi] [classification]

FreshML: programming with binders made simpleMark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay. ICFP 2003: 263-274 [doi] [classification]

2002

VL-Eli: A Generator for Visual Languages - System DemonstrationUwe Kastens, Carsten Schmidt. ENTCS, 65(3), 2002. [doi] [classification]

2001

An Axiomatic Approach to Metareasoning on Nominal Algebras in HOASFurio Honsell, Marino Miculan, Ivan Scagnetto. icalp 2001: 963-978 [doi] [classification]

Scoped Dynamic Rewrite RulesEelco Visser. ENTCS, 59(4), 2001. [doi] [classification]

2000

1999

Symbol Table Management in an HPF DebuggerMarian Bubak, Wlodzimierz Funika, Grzegorz Mlynarczyk, Krzysztof Sowa, Roland Wismüller. hpcn 1999: 1278-1281 [classification]

Debugging Eli-Generated Compilers With NoosaAnthony M. Sloane. cc 1999: 17-31 [classification]

1998

The Eli SystemUwe Kastens, Peter Pfahler, Matthias T. Jung. CC 1998: 294-297 [classification]

1997

Java Virtual MachineJon Meyer, Troy Downing. O Reilly, 1997. [classification]

Prototyping Realistic Programming Languages Based on Formal SpecificationsArnd Poetzsch-Heffter. ACTA, 34(10):737-772, 1997. [doi] [classification]

1996

Towards a Classification of Visibility RulesMichael A. Klug. SIGPLAN, 31(1):44-50, 1996. [classification]

1995

Polarized Name PassingMartin Odersky. fsttcs 1995: 324-337 [classification]

Attribute Grammar Paradigms - A High-Level Methodology in Language ImplementationJukka Paakki. ACM Comput. Surv., 27(2):196-255, 1995. [classification]

1994

Extensible syntax with lexical scopingLuca Cardelli, Florian Matthes, Martín Abadi. SRC Research Report 121, 1994. [doi] [classification]

Modularity and Reusability in Attribute GrammarsUwe Kastens, William M. Waite. ACTA, 31(7):601-627, 1994. [doi] [classification]

Basic operations of the VisiCola scope modelMichael A. Klug. SIGPLAN, 29(9):44-50, 1994. [doi] [classification]

Developing Efficient Interpreters Based on Formal Language SpecificationsArnd Poetzsch-Heffter. cc 1994: 233-247 [classification]

Designing a reusable symbol table libraryPei-Chi Wu, Jin-Hue Lin, Feng-Jian Wang. In TENCON '94. IEEE Region 10's Ninth Annual International Conference. Theme: Frontiers of Computer Technology. Proceedings of 1994. 1994: [doi] [classification]

1993

Defining Context-Dependent Syntax Without Using ContextsMartin Odersky. TOPLAS, 15(3):535-562, 1993. [doi] [classification]

Programming Language Specification and Prototyping Using the MAX SystemArnd Poetzsch-Heffter. plilp 1993: 137-150 [classification]

Modelling and Specifying Name Visibility and Binding SemanticsScott A. Vorthmann. Technical Report 1993. [classification]

1992

Another Solution of Scoping Problems in Symbol TablesWerner Aßmann. cc 1992: 66-71 [classification]

ELI: A Complete, Flexible Compiler Construction SystemRobert W. Gray, Steven P. Levi, Vincent P. Heuring, Anthony M. Sloane, William M. Waite. CACM, 35(2):121-130, 1992. [classification]

Implementing High-Level Identification SpecificationsArnd Poetzsch-Heffter. cc 1992: 59-65 [classification]

1991

An Abstract Data Type for Name AnalysisUwe Kastens, William M. Waite. ACTA, 28(6):539-558, 1991. [classification]

VisiCola, a model and a language for visibility control in programming languagesMichael A. Klug. SIGPLAN, 26(2):51-63, 1991. [doi] [classification]

Logic-Based Specification of Visibility RulesArnd Poetzsch-Heffter. plilp 1991: 63-74 [classification]

Design of a Reusable Symbol Table AbstractionPeter Schnorf. stp, 12(2):63-74, 1991. [classification]

1990

Identifiers and static name abstractionMark B. Wells. SIGPLAN, 25(5):25-28, 1990. [doi] [classification]

1987

Flexible Symbol Table Structures for Compiling C++Stephen C. Dewhurst. SPE, 17(8):503-512, 1987. [classification]

Modeling and Implementation of Visibility in Programming LanguagesGarrison, Phillip Edward. PhD thesis, EECS Department, University of California, Berkeley, Dec 1987. [classification]

1983

A Symbol Table Abstraction to Implement Languages with Explicit Scope ControlRobert P. Cook, Thomas J. LeBlanc. TSE, 9(1):8-12, 1983. [classification]

Generation of Compiler Symbol Processing MechanismsSteven P. Reiss. TOPLAS, 5(2):127-163, 1983. [doi] [classification]

1982

Binding Strategies and Scope Rules Are IndependentThomas R. Virgilio, Raphael A. Finkel. Comp. Lang., Syst. \& Struct., 7(2):61-67, 1982. [classification]

1979

Hashed symbol tables for languages with explicit scope controlSusan L. Graham, William N. Joy, Olivier Roubine. sigplan 1979: 50-57 [doi] [classification]

1976

Symbol Table AccessWilliam M. McKeeman. ac 1976: 253-301 [classification]

1970

A Symbol Table with Scope Recognition for the B-6500Henry J. Bowlden. algol 1971: 1-19 [classification]

1968

Semantics of Context-Free LanguagesDonald E. Knuth. mst, 2(2):127-145, 1968. [doi] [classification]