Work

Abstract syntax and variable binding

Year: 2003

Type: conference-abstract

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.

Source: ACM/IEEE Symposium on Logic in Computer Science (LICS)

DOI: 10.1109/lics.1999.782615

Authors: M. Fiore, G. Plotkin, D. Turi

Institutions: University of Sussex, University of Edinburgh

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2123887510

Cites: 44

Cited by: 396

Related to: 10