Nominal techniques in
computer science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, ...
are a range of techniques, based on
nominal sets, for handling names and binding, e.g. in
abstract syntax
In computer science, the abstract syntax of data is its structure described as a data type (possibly, but not necessarily, an abstract data type), independent of any particular representation or encoding. This is particularly used in the represent ...
. Research into nominal sets gave rise to
nominal terms, a metalanguage for embedding object languages with name binding constructs.
See also
*
De Bruijn index
In mathematical logic, the de Bruijn index is a tool invented by the Dutch mathematician Nicolaas Govert de Bruijn for representing terms of lambda calculus without naming the bound variables. Terms written using these indices are invariant with ...
*
Higher order abstract syntax
References
*
* {{cite journal
, doi = 10.1016/j.tcs.2004.06.016
, author = Christian Urban, Andrew M. Pitts and Murdoch J. Gabbay
, year = 2004
, title = Nominal unification
, journal = Theoretical Computer Science
, volume = 323
, issue = 1–3
, pages = 473–497
, doi-access = free
Theoretical computer science