Logic Column 14: Nominal Logic and Abstract Syntax

dc.creatorCheney, James
dc.date2005-11-05
dc.date.accessioned2026-07-07T06:49:34Z
dc.date.available2026-07-07T06:49:34Z
dc.descriptionFormalizing syntactic proofs of properties of logics, programming languages, security protocols, and other formal systems is a significant challenge, in large part because of the obligation to handle name-binding correctly. We present an approach called nominal abstract syntax that has attracted considerable interest since its introduction approximately six years ago. After an overview of other approaches, we describe nominal abstract syntax and nominal logic, a logic for reasoning about nominal abstract syntax. We also discuss applications of nominal techniques to programming, automated reasoning, and identify some future directions.
dc.description24 pages
dc.identifierhttps://arxiv.org/abs/cs/0511025
dc.identifierhttp://arxiv.org/abs/cs/0511025
dc.identifierSIGACT News 36 (4), pp. 47-69, 2005
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104393
dc.subjectLogic in Computer Science
dc.subjectF.4.1; F.3.1
dc.titleLogic Column 14: Nominal Logic and Abstract Syntax
dc.typetext

Files

Collections