 | This article includes a
list of references,
related reading, or
external links, but its sources remain unclear because it lacks
inline citations. (December 2010) |
Nominal techniques in computer science are a range of techniques, based on nominal sets, for handling names and binding, e.g. in abstract syntax. Research into nominal sets gave rise to nominal terms, a metalanguage for embedding object languages with name binding constructs.
See also
References
- Murdoch J. Gabbay and Andrew M. Pitts (2002). "A NEW approach to abstract syntax with variable binders". Formal Aspects of Computing. 13 (3–5): 341–363. CiteSeerX 10.1.1.7.4261. doi: 10.1007/s001650200016.
- Christian Urban, Andrew M. Pitts and Murdoch J. Gabbay (2004). "Nominal unification". Theoretical Computer Science. 323 (1–3): 473–497. doi: 10.1016/j.tcs.2004.06.016.
| This article includes a
list of references,
related reading, or
external links, but its sources remain unclear because it lacks
inline citations. (December 2010) |
Nominal techniques in computer science are a range of techniques, based on nominal sets, for handling names and binding, e.g. in abstract syntax. Research into nominal sets gave rise to nominal terms, a metalanguage for embedding object languages with name binding constructs.
See also
References
- Murdoch J. Gabbay and Andrew M. Pitts (2002). "A NEW approach to abstract syntax with variable binders". Formal Aspects of Computing. 13 (3–5): 341–363. CiteSeerX 10.1.1.7.4261. doi: 10.1007/s001650200016.
- Christian Urban, Andrew M. Pitts and Murdoch J. Gabbay (2004). "Nominal unification". Theoretical Computer Science. 323 (1–3): 473–497. doi: 10.1016/j.tcs.2004.06.016.