Show simple item record

dc.contributor.authorFiore, Marcelo P
dc.contributor.authorPlotkin, Gordon
dc.contributor.authorTuri, Daniele
dc.coverage.spatial10en
dc.date.accessioned2003-11-06T10:51:32Z
dc.date.available2003-11-06T10:51:32Z
dc.date.issued2003-11-06T10:51:32Z
dc.identifier.urihttp://hdl.handle.net/1842/221
dc.description.abstractWe 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 veri- fies the semantic substitution lemma.en
dc.format.extent204747 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.subjectLaboratory for Foundations of Computer Science
dc.titleAbstract Syntax and Variable Binding (Extended Abstract)en
dc.typePreprinten


Files in this item

This item appears in the following Collection(s)

Show simple item record