Squiers, C. C., and Kobayashi, Y. A finiteness condition for rewriting systems. Theoretical Comput. Sci. 131, 2 (12 Sept. 1994), 271--294. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Implementing the Recursive Definition of Abelian Group-Based.. - Giavitto, Michel (Correct)
....structure to the computation dependencies: they can be interpreted as paths in well handled spaces. Another direction of work is then the use of tools from algebraic topology to characterize the domain of computation (homotopy theory, etc. Such mathematical tools have already be proved useful [19, 43, 22]. Acknowledgments. We are grateful to the members of the Parallel Architectures team in LRI for many fruitful discussions, and we thank especially Jean Paul Sansonnet, Julien Soula (who has developed the Mathematica package for abelian fields) and Dominique De Vito (who implements currently the ....
Squiers, C. C., and Kobayashi, Y. A finiteness condition for rewriting systems. Theoretical Comput. Sci. 131, 2 (12 Sept. 1994), 271--294.
Design and Implementation of 8½, a Declarative.. - Michel (1995) (Correct)
....to the computation dependencies: they can be interpreted as paths in well handled spaces. Another direction of work is then the use of tools from algebraic topology to characterise the domain of computation (homotopy theory, etc. Such mathematical tools have already be proved useful [GJ92, SK94, HR95] Acknowledgments. The author wishes to thank the member of the 81 2 team: Jean Louis Giavitto, Jean Paul Sansonnet, Dominique De Vito, Abderrahmane Mahiout for many stimulating discussions. He also thanks Dan Truong, Laurence Cathala for their constructive comments. ....
C. C. Squiers and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131(2):271--294, 12 September 1994.
Group-Based Fields - Giavitto, Michel, Sansonnet (1995) (3 citations) (Correct)
....structure to the computation dependencies: they can be interpreted as paths in well handled spaces. Another direction of work is then the use of tools from algebraic topology to characterise the domain of computation (homotopy theory, etc. Such mathematical tools have already be proved useful [20, 21]. Acknowledgements. We are grateful to the members of the Parallel Architectures team in LRI for many fruitful discussions, and we thank especially Dominique De Vito and Abderrahmane Mahiout. ....
C. C. Squiers and Y. Kobayashi. A finiteness condition for rewriting systems. Theoretical Computer Science, 131(2):271--294, 12 September 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC