Journal of the ACM Bibliography

Selected papers that cite this one

• Samson Abramsky and Radha Jagadeesan. New foundations for the geometry of interaction. Information and Computation, 111(1):53-119, 15 May 1994.

• L. Aceto and M. Hennessy. Termination, deadlock, and divergence. Journal of the ACM, 39(1):147-187, January 1992.

• Luca Aceto and Anna Ingólfsdóttir. CPO models for compact GSOS languages. Information and Computation, 129(2):107-141, 15 September 1996.

• Stephen L. Bloom and Zoltán Ésik. The equational logic of fixed points. Theoretical Computer Science, 179(1-2):1-60, 1 June 1997. Tutorial.

• Ingo Claßen, Martin Große-Rhode, and Uwe Wolter. Categorical concepts for parameterized partial specifications. Mathematical Structures in Computer Science, 5(2):153-188, June 1995.

• Richard H. Connelly and F. Lockwood Morris. A generalization of the trie data structure. Mathematical Structures in Computer Science, 5(3):381-418, September 1995.

• Bruno Courcelle. A representation of trees by languages II. Theoretical Computer Science, 7(1):25-55, August 1978.

• Bruno Courcelle. Basic notions of universal algebra for language theory and graph grammars. Theoretical Computer Science, 163(1-2):1-54, 30 August 1996. Tutorial.

• Bruno Courcelle. A representation of trees by languages I. Theoretical Computer Science, 6(3):255-279, June 1978.

• Ugo de'Liguoro and Adolfo Piperno. Non deterministic extensions of untyped lambda-calculus. Information and Computation, 122(2):149-177, 1 November 1995.

• R\u{a}zvan Diaconescu. Completeness of category-based equational deduction. Mathematical Structures in Computer Science, 5(1):9-40, March 1995.

• Z. Ésik. Group axioms for iteration. Accepted for publication in Information and Computation. Final manuscript received for publication April 6, 1998.

• Z. Ésik. Axiomatizing the equational theory of regular tree languages (extended abstract). In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 455-465, Paris France, 25-27 February 1998. Springer.

• Solomon Feferman. A new approach to abstract data types, I: Informal development. Mathematical Structures in Computer Science, 2(2):193-229, June 1992.

• Joseph A. Goguen. A categorical manifesto. Mathematical Structures in Computer Science, 1(1):49-67, March 1991.

• Joseph A. Goguen and Rod M. Burstall. Institutions: Abstract model theory for specification and programming. Journal of the ACM, 39(1):95-146, January 1992.

• Joseph Goguen and R\u{a}zvan Diaconescu. An Oxford survey of order sorted algebra. Mathematical Structures in Computer Science, 4(3):363-392, September 1994.

• M. Hennessy. Synchronous and asynchronous experiments on processes. Information and Control, 59(1-3):36-83, October/November/December 1983.

• Theo M. V. Janssen. Algebraic translations, correctness and algebraic compiler construction. Theoretical Computer Science, 199(1-2):25-56, 15 June 1998.

• Björn Lisper. Computing in unpredictable environments: semantics, reduction strategies, and program transformations. Theoretical Computer Science, 190(1):61-85, 10 January 1998.

• Mogens Nielsen, Gordon Plotkin, and Glynn Winskel. Petri nets, event structures and domains, part I. Theoretical Computer Science, 13(1):85-108, January 1981.

• Adam Obtu{\l}owicz. Algebra of constructsion II: an algebraic approach to Martin-Löf theory and the calculus of constructions. Mathematical Structures in Computer Science, 3(1):63-92, March 1993.

• John C. Reynolds and Gordon D. Plotkin. On functors expressible in the polymorphic typed lambda calculus. Information and Computation, 105(1):1-29, July 1993.

• Hartmut Schmeck. Algebraic semantics of recursive flowchart schemes. Information and Control, 59(1-3):108-126, October/November/December 1983.

• Eelco Visser. Polymorphic syntax definition. Theoretical Computer Science, 199(1-2):57-86, 15 June 1998.

• Heiko Vogler. Functional description of the contextual analysis in block-structured programming languages: a case study of tree transducers. Science of Computer Programming, 16(3):251-275, October 1991.

• J. B. Wright, E. G. Wagner, and J. W. Thatcher. A uniform approach to inductive posets and inductive closure. Theoretical Computer Science, 7(1):57-77, August 1978.

Shortcuts: