Variable binding (researchr/bibliography/publications)

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2020

Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specificationsArjen Rouvoet, Hendrik van Antwerpen, Casper Bach Poulsen, Robbert Krebbers, Eelco Visser. PACMPL, 4(OOPSLA), 2020. [doi] [classification]

2018

2015

A Theory of Name ResolutionPierre Néron, Andrew P. Tolmach, Eelco Visser, Guido Wachsmuth. ESOP 2015: 205-231 [doi] [classification]

Binding Structures as an Abstract Data TypeWilmer Ricciotti. ESOP 2015: 762-786 [doi] [classification]

2013

Names for free: polymorphic views of names and bindersJean-Philippe Bernardy, Nicolas Pouillard. haskell 2013: 13-24 [doi] [classification]

2012

The Locally Nameless RepresentationArthur Charguéraud. JAR, 49(3):363-408, 2012. [doi] [classification]

The Spoofax Name Binding LanguageGabriël 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: [doi] [classification]

Namely, Painless: A unifying approach to safe programming with first-order syntax with binders. (Une approche unifiante pour programmer sûrement avec de la syntaxe du premier ordre contenant des lieurs)Nicolas Pouillard. PhD thesis, Paris Diderot University, France, 2012. [doi] [classification]

2011

Nameless, painlessNicolas Pouillard. ICFP 2011: 320-332 [doi] [classification]

Binders unboundStephanie Weirich, Brent A. Yorgey, Tim Sheard. ICFP 2011: 333-345 [doi] [classification]

2010

A fresh look at programming with names and bindersNicolas Pouillard, François Pottier. ICFP 2010: 217-228 [doi] [classification]

2008

Engineering formal metatheoryBrian E. Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, Stephanie Weirich. POPL 2008: 3-15 [doi] [classification]

Parametric higher-order abstract syntax for mechanized semanticsAdam J. Chlipala. ICFP 2008: 143-156 [doi] [classification]

2006

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

2004

Nominal unificationChristian Urban, Andrew M. Pitts, Murdoch Gabbay. TCS, 323(1-3):473-497, 2004. [doi] [classification]

2003

Nominal logic, a first order theory of names and bindingAndrew M. Pitts. iandc, 186(2):165-193, 2003. [doi] [classification]

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

2002

A New Approach to Abstract Syntax with Variable BindingMurdoch Gabbay, Andrew M. Pitts. fac, 13(3-5):341-363, 2002. [doi] [classification]

1994

Substitution: A Formal Methods Case Study Using Monads and TransformationsFrançoise Bellegarde, James Hook. SCP, 23(2-3):287-311, 1994. [classification]

1993

Pure Type Systems FormalizedJames McKinna, Robert Pollack. tlca 1993: 289-305 [classification]

1988

Higher-Order Abstract SyntaxFrank Pfenning, Conal Elliott. PLDI 1988: 199-208 [doi] [classification]

1972

Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theoremN. G. de Bruijn. Indagationes Mathematicae, 34(5):381-392, 1972. [classification]

Sign in or sign up to see more results.

runs on WebDSL