Nominal techniques

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

* De Bruijn index
* Higher order abstract syntax

## 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. 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.

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Nominal techniques. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Nominal_techniques&oldid=188053"