Languages, Theory

by Neil Ghani , Tarmo Uustalu

Datum	Value	Source
TITLE	Languages, Theory	SVM HeaderParse 0.2
AUTHOR NAME	Neil Ghani	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Math. and Comp. Sci.; University of Leicester	SVM HeaderParse 0.2
AUTHOR ADDR	University Road, Leicester LE1 7RH, UK	SVM HeaderParse 0.2
AUTHOR NAME	Tarmo Uustalu	SVM HeaderParse 0.2
AUTHOR AFFIL	Institute of Cybernetics; Tallinn Technical University	SVM HeaderParse 0.2
AUTHOR ADDR	Akadeemia tee 21, EE-12618 Tallinn, Estonia	SVM HeaderParse 0.2
ABSTRACT	Recently there has been a great deal of interest in higherorder syntax which seeks to extend standard initial algebra semantics to cover languages with variable binding by using functor categories. The canonical example studied in the literature is that of the untyped λ-calculus which is handled as an instance of the general theory of binding algebras, cf. Fiore, Plotkin, Turi [8]. Another important syntactic construction is that of explicit substitutions. The syntax of a language with explicit substitutions does not form a binding algebra as an explicit substitution may bind an arbitrary number of variables. Nevertheless we show that the language given by a standard signature Σ and explicit substitutions is naturally modelled as the initial algebra of the endofunctor Id + FΣ ◦ + ◦ on a functor category. We also comment on the apparent lack of modularity in syntax with variable binding as compared to first-order languages. Categories and Subject Descriptors	SVM HeaderParse 0.2
CITATIONS	16 found	ParsCit 1.0