### 14 papers:

- CADE-2013-Mayer #hybrid #logic #proving #transitive
- A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (MCM), pp. 76–90.
- FoSSaCS-2012-KurzST #on the #regular expression
- On Nominal Regular Languages with Binders (AK, TS, ET), pp. 255–269.
- ICALP-v2-2012-FernandezR #term rewriting
- Nominal Completion for Rewrite Systems with Binders (MF, AR), pp. 201–213.
- POPL-2012-CaveP #data type #programming
- Programming with binders and indexed data-types (AC, BP), pp. 413–424.
- ICFP-2011-WeirichYS #bound
- Binders unbound (SW, BAY, TS), pp. 333–345.
- ICFP-2010-PouillardP #fresh look #programming
- A fresh look at programming with names and binders (NP, FP), pp. 217–228.
- ESOP-2009-LakinP #functional #higher-order #induction #programming
- Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming (MRL, AMP), pp. 47–61.
- QAPL-2006-DeganoPPQ #biology
- Beta-binders for Biological Quantitative Experiments (PD, DP, CP, PQ), pp. 101–117.
- CSL-2005-CateF #complexity #hybrid #logic #on the
- On the Complexity of Hybrid Logics with Binders (BtC, MF), pp. 339–354.
- ICFP-2003-ShinwellPG #named #programming
- FreshML: programming with binders made simple (MRS, AMP, MG), pp. 263–274.
- ICFP-2001-Pitts #approach #functional #programming #representation #syntax
- A Fresh Approach to Representing Syntax with Static Binders in Functional Programming (AMP), p. 1.
- CL-2000-Miller #bibliography #perspective #syntax
- Abstract Syntax for Variable Binders: An Overview (DM), pp. 239–253.
- GCSE-1999-Jarvi #c++
- C++ Function Object Binders Made Easy (JJ), pp. 165–177.
- LICS-1999-GabbayP #approach #syntax
- A New Approach to Abstract Syntax Involving Binders (MG, AMP), pp. 214–224.