Result: Abstract syntax and variable binding for linear binders
Title:
Abstract syntax and variable binding for linear binders
Authors:
Source:
MFCS 2000 : mathematical foundations of computer science (Bratislava, 28 August - 1 September 2000)Lecture notes in computer science. :670-679
Publisher Information:
Berlin: Springer, 2000.
Publication Year:
2000
Physical Description:
print, 21 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algèbre linéaire, Linear algebra, Algebra lineal, Langage programmation, Programming language, Lenguaje programación, Liaison, Binding, Enlace, Monoïde, Monoid, Monoide, Syntaxe, Syntax, Sintaxis, Sémantique, Semantics, Semántica
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Graduate School of Informatics, Kyoto University, Japan
ISSN:
0302-9743
Rights:
Copyright 2000 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.1384458
Database:
PASCAL Archive
Further Information
We apply the theory of binding algebra to syntax with linear binders. We construct a category of models for a linear binding signature. The initial model serves as abstract syntax for the signature. Moreover it contains structure for modelling simultaneous substitution. We use the presheaf category on the free strict symmetric monoidal category on 1 to construct models of each binding signature. This presheaf category has two monoidal structures, one of which models pairing of terms and the other simultaneous substitution.