About: Nominal terms (computer science)

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Nominal terms (computer science) Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

Nominal terms are a metalanguage for embedding object languages with binding constructs into. Intuitively, they may be seen as an extension of first-order terms with support for name binding. Consequently, the native notion of equality between two nominal terms is alpha-equivalence (equivalence up to a permutative renaming of bound names). Nominal terms came out of a programme of research into nominal sets, and have a concrete semantics in those sets.

Attributes	Values
rdfs:label	Nominal terms (computer science) (en)
rdfs:comment	Nominal terms are a metalanguage for embedding object languages with binding constructs into. Intuitively, they may be seen as an extension of first-order terms with support for name binding. Consequently, the native notion of equality between two nominal terms is alpha-equivalence (equivalence up to a permutative renaming of bound names). Nominal terms came out of a programme of research into nominal sets, and have a concrete semantics in those sets. (en)
sameAs	Nominal terms (computer science)
dbp:wikiPageUsesTemplate	dbt:Cite_conference dbt:Cite_journal dbt:Cite_thesis dbt:Clarify dbt:Empty_section
Subject	Theoretical computer science
gold:hypernym	Metalanguage
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Nominal_terms_(computer_science)?oldid=1053266524&ns=0
Wikipage page ID	27345568 (xsd:integer)
page length (characters) of wiki page	6628 (xsd:nonNegativeInteger)
Wikipage revision ID	1053266524 (xsd:integer)
Link from a Wikipage to another Wikipage	Logic Logic programming Nominal techniques Programming language Prolog Undecidable problem Unification (computer science) Abstract syntax tree ΛProlog Π-calculus Theoretical computer science Metalanguage De Bruijn index Compiler Computer science Higher-order abstract syntax First-order logic Lambda calculus Simply typed lambda calculus dbr:AlphaProlog
has abstract	Nominal terms are a metalanguage for embedding object languages with binding constructs into. Intuitively, they may be seen as an extension of first-order terms with support for name binding. Consequently, the native notion of equality between two nominal terms is alpha-equivalence (equivalence up to a permutative renaming of bound names). Nominal terms came out of a programme of research into nominal sets, and have a concrete semantics in those sets. Where the regular unification found in Prolog is linear in the size of terms compared, the extension to faithfully capture equivalence of nominal terms, called nominal unification in the literature, is quadratic (Calvès 2013). Based on an earlier PTIME algorithm for nominal unification, is a Prolog-like logic programming language with facilities for binding names in terms, which was intended to be useful for programs acting on program syntax (Cheney 2004). Nominal term embeddings may be seen as alternatives to de Bruijn encodings and higher-order abstract syntax, where the latter uses the simply typed lambda calculus as a metalanguage. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Nominal_terms_(computer_science)
is Link from a Wikipage to another Wikipage of	Nominal techniques Nominal terms

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (82 GB total memory, 2 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software