TAPSOFT '91: Proceedings of the International Joint Conference on Theory and Practice of Software Development Brighton, UK, April 8–12, 1991 [1 ed.]
3540539824, 9783540539827
TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was hel
Table of contents : Full abstraction for series-parallel pomsets....Pages 1-25 On causality observed incrementally, finally....Pages 26-41 On the domain of traces and sequential composition....Pages 42-56 Compilation of pattern matching with associative-commutative functions....Pages 57-73 Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties....Pages 74-89 Algebraic graph rewriting using a single pushout....Pages 90-102 Unifying initial and loose semantics of parameterized specifications in an arbitrary institution....Pages 103-120 Non-strict don't care algebras and specifications....Pages 121-142 Program specification and data refinement in type theory....Pages 143-168 Static analysis of linear congruence equalities among variables of a program....Pages 169-192 Simple solutions for approximate tree matching problems....Pages 193-201 The tree inclusion problem....Pages 202-214 Introducing a calculus of trees....Pages 215-240 Domains in a realizability framework....Pages 241-263 Iteration algebras extended abstract....Pages 264-274 Logic programming as hypergraph Rewriting....Pages 275-295 A fully abstract model for concurrent constraint programming....Pages 296-319 A solved form algorithm for ask and tell Herbrand constraints....Pages 320-337 A calculus of broadcasting systems....Pages 338-358 Object-based concurrency : A process calculus analysis....Pages 359-380 On the complexity of equation solving in process algebra....Pages 381-396 Comparative semantics for a real-time programming language with integration....Pages 397-411 A complete proof system for timed observations....Pages 412-440 Type inference with inequalities....Pages 441-455