Lics

ACM/IEEE Symposium on Logic in Computer Science

LICS Home - LICS Awards - LICS Newsletters - LICS Archive - LICS Organization - Logic-Related Conferences - Links

Fourteenth Annual IEEE Symposium on

Logic in Computer Science (LICS 1999)

Paper: Abstract Syntax and Variable Binding (at LICS 1999)

Winner of the Test-of-Time Award in 2019
Authors: Marcelo P. Fiore Gordon D. Plotkin Daniele Turi

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.

BibTeX

  @InProceedings{FiorePlotkinTuri-AbstractSyntaxandVa,
    author = 	 {Marcelo P. Fiore and Gordon D. Plotkin and Daniele Turi},
    title = 	 {Abstract Syntax and Variable Binding},
    booktitle =  {Proceedings of the Fourteenth Annual IEEE Symposium on Logic in Computer Science (LICS 1999)},
    year =	 {1999},
    month =	 {July}, 
    pages =      {193--202},
    location =   {Trento, Italy}, 
    publisher =	 {IEEE Computer Society Press}
  }
   

Last modified: 2022-10-3113:49
Sam Staton