Title :
Second-Order and Dependently-Sorted Abstract Syntax
Author_Institution :
Comput. Lab., Cambridge Univ., Cambridge
Abstract :
The paper develops a mathematical theory in the spirit of categorical algebra that provides a model theory for second-order and dependently-sorted syntax. The theory embodies notions such as alpha-equivalence, variable binding, capture-avoiding simultaneous substitution, term metavariable, meta-substitution, mono and multi sorting, and sort dependency. As a matter of illustration, a model is used to extract a second-order syntactic theory, which is thus guaranteed to be correct by construction.
Keywords :
category theory; computational linguistics; process algebra; sorting; categorical algebra; dependently-sorted abstract syntax; mathematical theory; model theory; second-order abstract syntax; second-order syntactic theory; Algebra; Computer science; Laboratories; Logic functions; MONOS devices; Mathematical model; Sorting; abstract syntax; alpha-equivalence; categorical algebra; dependently-sorted syntax; meta-substitution; metavariable; second-order syntax; substitution; variable binding;
Conference_Titel :
Logic in Computer Science, 2008. LICS '08. 23rd Annual IEEE Symposium on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
978-0-7695-3183-0
DOI :
10.1109/LICS.2008.38