Second-Order Algebraic Theories - (Extended Abstract)

Fiore and Hur [10] recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a formal deductive system for languages with variable binding and parameterised metavariables. This work completes the foundations of the subject from the viewpoint of categorical algebra. Specifically, the paper introduces the notion of second-order algebraic theory and develops its basic theory. Two categorical equivalences are established: at the syntactic level, that of second-order equational presentations and second-order algebraic theories; at the semantic level, that of second-order algebras and second-order functorial models. Our development includes a mathematical definition of syntactic translation between second-order equational presentations. This gives the first formalisation of notions such as encodings and transforms in the context of languages with variable binding.

[1]  John Power,et al.  The Category Theoretic Understanding of Universal Algebra: Lawvere Theories and Monads , 2007, Computation, Meaning, and Logic.

[2]  Chung-Kil Hur,et al.  Second-Order Equational Logic (Extended Abstract) , 2010, CSL.

[3]  F. W. Lawvere,et al.  Some algebraic problems in the context of functorial semantics of algebraic theories , 1968 .

[4]  George Gratzer,et al.  Universal Algebra , 1979 .

[5]  John McCarthy,et al.  Towards a Mathematical Science of Computation , 1962, IFIP Congress.

[6]  Joseph A. Goguen,et al.  Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories , 1991, Theor. Comput. Sci..

[7]  Chung-Kil Hur,et al.  Term Equational Systems and Logics: (Extended Abstract) , 2008, MFPS.

[8]  Vincent van Oostrom,et al.  Combinatory Reduction Systems: Introduction and Survey , 1993, Theor. Comput. Sci..

[9]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[10]  Gordon D. Plotkin,et al.  Abstract syntax and variable binding , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[11]  Chung-Kil Hur,et al.  Second-order equational logic , 2010, CSL 2010.

[12]  F. E. J. Linton,et al.  Some Aspects of Equational Categories , 1966 .

[13]  P. J. Higgins.  UNIVERSAL ALGEBRA: (Mathematics and its Applications, 6) , 1982 .

[14]  Frank Pfenning,et al.  Higher-order abstract syntax , 1988, PLDI '88.

[15]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[16]  Rod M. Burstall,et al.  Proving Properties of Programs by Structural Induction , 1969, Comput. J..

[17]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[18]  Marcelo P. Fiore,et al.  Second-Order and Dependently-Sorted Abstract Syntax , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[19]  Tsuyoshi Fujiwara.  On mappings between algebraic systems , 1959 .

[20]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[21]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[22]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

[23]  P. Aczel.  Frege Structures and the Notions of Proposition, Truth and Set* , 1980 .