Zobrazeno 1 - 10
of 657
pro vyhledávání: '"Nominal Logic"'
Autor:
Dowek, Gilles, Gabbay, Murdoch J.
Publikováno v:
ACM Transactions on Computational Logic, Volume 13, Number 3, Article 20, Publication date: August 2012
Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such as of the lambda-binder of the lambda-calculus or the for
Externí odkaz:
http://arxiv.org/abs/2312.16480
Autor:
Cheney, James
Nominal logic is a variant of first-order logic that provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values consi
Externí odkaz:
http://arxiv.org/abs/1312.4840
Autor:
Bengtson, Jesper, Parrow, Joachim
Publikováno v:
Logical Methods in Computer Science, Volume 5, Issue 2 (June 30, 2009) lmcs:832
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to
Externí odkaz:
http://arxiv.org/abs/0809.3960
Autor:
Cheney, James, Urban, Christian
Publikováno v:
ACM Transactions on Programming Languages and Systems 30(5):26, August 2008
Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence). This article investigates logic programm
Externí odkaz:
http://arxiv.org/abs/cs/0609062
Autor:
Cheney, James
Publikováno v:
The Journal of Symbolic Logic, 2006 Mar 01. 71(1), 299-320.
Externí odkaz:
https://www.jstor.org/stable/27588449
Autor:
Clouston, Ranald
Publikováno v:
EPTCS 71, 2011, pp. 44-57
Many formal systems, particularly in computer science, may be captured by equations modulated by side conditions asserting the "freshness of names"; these can be reasoned about with Nominal Equational Logic (NEL). Like most logics of this sort NEL em
Externí odkaz:
http://arxiv.org/abs/1111.0088
Autor:
Cheney, James
Publikováno v:
SIGACT News 36 (4), pp. 47-69, 2005
Formalizing 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 cal
Externí odkaz:
http://arxiv.org/abs/cs/0511025
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ranald Clouston
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 71, Iss Proc. LFMTP 2011, Pp 44-57 (2011)
Many formal systems, particularly in computer science, may be captured by equations modulated by side conditions asserting the "freshness of names"; these can be reasoned about with Nominal Equational Logic (NEL). Like most logics of this sort NEL em
Externí odkaz:
https://doaj.org/article/70f95486ea7841eaa56cc7125c027ab6