| Article ID | Journal | Published Year | Pages | File Type | 
|---|---|---|---|---|
| 424390 | Electronic Notes in Theoretical Computer Science | 2007 | 35 Pages | 
Abstract
												This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is an extension of ordinary equational logic with assertions about the freshness of names. It is shown to be both sound and complete for the support interpretation of freshness and equality provided by the Gabbay-Pitts nominal sets model of names, binding and α-conversion.
Related Topics
												
													Physical Sciences and Engineering
													Computer Science
													Computational Theory and Mathematics
												
											