Abstract Syntax and Variable Binding for Linear Binders

  • Miki Tanaka
Conference paper

DOI: 10.1007/3-540-44612-5_62

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1893)
Cite this paper as:
Tanaka M. (2000) Abstract Syntax and Variable Binding for Linear Binders. In: Nielsen M., Rovan B. (eds) Mathematical Foundations of Computer Science 2000. MFCS 2000. Lecture Notes in Computer Science, vol 1893. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Miki Tanaka
    • 1
  1. 1.Graduate School of InformaticsKyoto UniversityJapan

Personalised recommendations