Proceedings - Symposium on Logic in Computer Science · 2008 · 59 citations · 17 references
ComputingComputer ScienceMathematicsAlgebraProgramming LanguagesSyntaxModel TheorySyntactic AnalysisType SystemsSorting
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.
17
Constructing Induction Rules for Deductive Synthesis Proofs
Alan Bundy, Lucas Dixon, Jeremy Gow et al. · Electronic Notes in Theoretical Computer Science · 2006 · 2.8K citations · Full text
Abstract syntax and variable binding
Marcelo Fiore, Gordon Plotkin, Daniele Turi · 2003 · 359 citations · Full text
Generalised algebraic theories and contextual categories
John Cartmell · Annals of Pure and Applied Logic · 1986 · 212 citations
Practical foundations of mathematics
Choice Reviews Online · 2000 · 166 citations