DocumentCode
3037330
Title
Abstract syntax and variable binding
Author
Fiore, Marcelo ; Plotkin, Gordon ; Turi, Daniele
Author_Institution
Sussex Univ., Brighton, UK
fYear
1999
fDate
1999
Firstpage
193
Lastpage
202
Abstract
We develop a theory of abstract syntax with variable binding. To every binding signature we associate a category of models consisting of variable sets endowed with compatible algebra and substitution structures. The syntax generated by the signature is the initial model. This gives a notion of initial algebra semantics encompassing the traditional one; besides compositionality, it automatically verifies the semantic substitution lemma
Keywords
process algebra; abstract syntax; category of models; compatible algebra; initial algebra semantics; semantic substitution lemma; substitution structures; variable binding; Algebra; Carbon capture and storage; Computer languages; Concrete; Integral equations; Logic; Production; Proposals; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1999. Proceedings. 14th Symposium on
Conference_Location
Trento
ISSN
1043-6871
Print_ISBN
0-7695-0158-3
Type
conf
DOI
10.1109/LICS.1999.782615
Filename
782615
Link To Document