论文信息 - Towards an algebraic theory of Boolean circuits - 字舞流文

Towards an algebraic theory of Boolean circuits

Yves Lafont | Y. Lafont

[1] A. Massol. Minimality of the System of Seven Equations for the Category of Finite Sets , 1997, Theor. Comput. Sci..

[2] Anne Massol. Calcul symbolique avec des diagrammes de Penrose , 1997 .

[3] Yves Lafont. A new finiteness condition for monoids presented by complete rewriting systems , 1995 .

[4] Friedrich Otto,et al. A Finiteness Condition for Rewriting Systems , 1994, Theor. Comput. Sci..

[5] Albert Burroni,et al. Higher-Dimensional Word Problems with Applications to Equational Logic , 1993, Theor. Comput. Sci..

[6] Yves Lafont. Equational Reasoning with Two-Dimensional Diagrams , 1993, Term Rewriting.

[7] Y. Lafont. Applications of Categories in Computer Science: Penrose diagrams and 2-dimensional rewriting , 1992 .

[8] Yves Lafont,et al. Church-Rooser property and homology of monoids , 1991, Mathematical Structures in Computer Science.

[9] Albert Burroni. Higher Dimensional Word Problem , 1991, Category Theory and Computer Science.

[10] Craig C. Squier,et al. Word problems and a homological niteness condition for monoids , 1987 .

[11] S. Maclane,et al. Categories for the Working Mathematician , 1971 .

[12] Law Fw. FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[13] F. W. Lawvere,et al. FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.