Equational properties of iterative monads

A method and apparatus for optimizing the signal transmission speed between a signal source and a signal receiver of a microelectronic circuit is disclosed. The method includes the step of providing a signal transmission path whose length provides a predetermined ratio between its resistance and characteristic impedance which will reproduce the transmitted signal at the receiving end upon the first signal transition. The length of this transmission path may be increased by using a nonhomogeneous line structure in which the characteristic impedance increases in the direction of the signal transmission. In one form of the invention, the signal transmission path is formed by interconnecting a plurality of micro-strip conductors disposed on different planes of a universally programmable silicon circuit board. Under the appropriate circumstances, a signal can travel through such a "semi-lossy" transmission path at approximately the speed of light.

[1]  Jirí Adámek,et al.  What Are Iteration Theories? , 2007, MFCS.

[2]  Z. Ésik,et al.  Iteration Theories: The Equational Logic of Iterative Processes , 1993 .

[3]  Stefan Milius.  Completely iterative algebras and completely iterative monads , 2005, Inf. Comput..

[4]  S. Lack,et al.  Introduction to extensive and distributive categories , 1993 .

[5]  Alexandra Silva,et al.  An Algebra for Kripke Polynomial Coalgebras , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[6]  Lawrence S. Moss,et al.  Recursion and Corecursion Have the Same Equational Logic , 2003, MFPS.

[7]  P. Gabriel,et al.  Lokal α-präsentierbare Kategorien , 1971 .

[8]  Jirí Adámek,et al.  Iterative reflections of monads , 2010, Math. Struct. Comput. Sci..

[9]  Lawrence S. Moss.  Parametric corecursion , 2001, Theor. Comput. Sci..

[10]  Gordon D. Plotkin,et al.  Complete axioms for categorical fixed-point operators , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[11]  M. Barr.  Coequalizers and free triples , 1970 .

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

[13]  Peter Aczel,et al.  Infinite trees and completely iterative theories: a coalgebraic view , 2003, Theor. Comput. Sci..

[14]  Christoph Lüth,et al.  Algebras, Coalgebras, Monads and Comonads , 2001, CMCS.

[15]  C. C. Elgot,et al.  On the algebraic structure of rooted trees , 1978 .

[16]  Susanna Ginali,et al.  Regular Trees and the Free Iterative Theory , 1979, J. Comput. Syst. Sci..

[17]  James Worrell,et al.  On the final sequence of a finitary set functor , 2005, Theor. Comput. Sci..

[18]  Joseph A. Goguen,et al.  Rational algebraic theories and fixed-point solutions , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[19]  Zoltán Ésik.  Axiomatizing Iteration Categories , 1999, Acta Cybern..

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

[21]  Eric Badouel,et al.  Terms and Infinite Trees as Monads Over a Signature , 1989, TAPSOFT, Vol.1.

[22]  G. M. Kelly,et al.  Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .

[23]  Jirí Adámek,et al.  Iterative algebras at work , 2006, Mathematical Structures in Computer Science.

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

[25]  C. C. Elgot.  Monadic Computation And Iterative Algebraic Theories , 1982 .

[26]  Stefan Milius,et al.  ITERATIVE ALGEBRAS: HOW ITERATIVE ARE THEY? , 2008 .

[27]  R. Lathe.  Phd by thesis , 1988, Nature.

[28]  Peter Aczel,et al.  A Coalgebraic View of Infinite Trees and Iteration , 2001, CMCS.

[29]  Jerzy Tiuryn.  Unique Fixed Points Vs. Least Fixed Points , 1980, Theor. Comput. Sci..

[30]  Jirí Adámek,et al.  Elgot Theories: A New Perspective of Iteration Theories (Extended Abstract) , 2009, MFPS.