We introduce weak binders, a lightweight construct to deal with fresh names in nominal calculi. Weak binders do not define the scope of names as precisely as the standard ν-binders, yet they enjoy strong semantic properties. We provide them with a denotational semantics, an equational theory, and a trace inclusion preorder. Furthermore, we present a trace-preserving mapping between weak binders and ν-binders.

Trovami (UniCASearch)


Titolo: Hard Life with Weak Binders
Autori: 
BARTOLETTI, MASSIMO
mostra contributor esterni 
Data di pubblicazione: 2009
Rivista: 
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE  
Abstract: We introduce weak binders, a lightweight construct to deal with fresh names in nominal calculi. Weak binders do not define the scope of names as precisely as the standard ν-binders, yet they enjoy strong semantic properties. We provide them with a denotational semantics, an equational theory, and a trace inclusion preorder. Furthermore, we present a trace-preserving mapping between weak binders and ν-binders.
Handle: http://hdl.handle.net/11584/18416
Tipologia:1.1 Articolo in rivista

File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2020