Conferences in DBLP
C. A. R. Hoare The Varieties of Programming Language. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:1-18 [Conf ] Jean-Louis Lassez , Ken McAloon Independence of Negative Constraints. [Citation Graph (1, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:19-27 [Conf ] Pierre Lescanne Completion Procedures as Transition Rules + Control. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:28-41 [Conf ] Martin Wirsing , Manfred Broy A Modular Framework for Specification and Implementation. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:42-73 [Conf ] Egidio Astesiano , Maura Cerioli On the Existence of Initial Models for Partial (Higher-Order) Conditional Specifications. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:74-88 [Conf ] Eric Badouel Terms and Infinite Trees as Monads Over a Signature. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:89-103 [Conf ] Ricardo A. Baeza-Yates The Subsequence Graph of a Text. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:104-118 [Conf ] Joffroy Beauquier , Annie Choquet , Antoine Petit , Guy Vidal-Naquet Syntactical Properties of Unbounded Nets of Processors. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:119-133 [Conf ] Stephen L. Bloom , Klaus Sutner Shuffle Equations, Parallel Transition Systems and Equational Petri Nets. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:134-148 [Conf ] Gérard Boudol Towards a Lambda-Calculus for Concurrent and Communicating Systems. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:149-161 [Conf ] Antonio Brogi , Roberto Gorrieri A Distributed, Net Oriented Semantics for Delta Prolog. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:162-177 [Conf ] Arie de Bruin , Erik P. de Vink Continuation Semantics for PROLOG with Cut. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:178-192 [Conf ] Marie-Pierre Delest , Jean-Marc Fedou Labeled Trees and Relations on Generating Functions. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:193-206 [Conf ] Pierre Deransart Proofs of Declarative Properties of Logic Programs. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:207-226 [Conf ] Aline Deruyver , Rémi Gilleron The Reachability Problem for Ground TRS and Some Extensions. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:227-243 [Conf ] Harald Ganzinger Order-Sorted Completion: The Many-Sorted Way (Extended Abstract). [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:244-258 [Conf ] Martin Gogolla Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach. [Citation Graph (1, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:259-274 [Conf ] Annegret Habel , Hans-Jörg Kreowski , Walter Vogler Decidable Boundedness Problems for Hyperedge-Replacement Graph Grammar. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:275-289 [Conf ] Rolf Hennicker Implementation of Parameterized Observational Specifications. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:290-305 [Conf ] Simon M. Kaplan , Steven K. Goering Priority Controlled Incremental Attribute Evaluation in Attributed Graph Grammars. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:306-336 [Conf ] Pierangelo Miglioli , Ugo Moscato , Mario Ornaghi Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:337-351 [Conf ] Peter Padawitz Inductive Proofs by Resolution and Paramodulation. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:352-368 [Conf ] Colin Stirling , David Walker Local Model Checking in the Modal Mu-Calculus. [Citation Graph (0, 0)][DBLP ] TAPSOFT, Vol.1, 1989, pp:369-383 [Conf ]