![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
4. TAPSOFT 1991: Brighton, UK
->Volume 2
CAAP Colloquium on Trees in Algebra and Programming
- Luca Aceto:
Full Abstraction for Series-Parallel Pomsets. 1-25 - Gian-Luigi Ferrari
:
On Causality Observed Incrementally, Finally. 26-41 - Marta Z. Kwiatkowska:
On the Domain of Traces and Sequential Composition. 42-56 - Emmanuel Kounalis, Denis Lugiez:
Compilation of Pattern Matching with Associative-Commutative Functions. 57-73 - Anne-Cécile Caron
:
Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. 74-89 - P. M. van den Broek:
Algebraic Graph Rewriting Using a Single Pushout. 90-102 - Hubert Baumeister:
Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution. 103-120 - Egidio Astesiano, Maura Cerioli
:
Non-Strict Don't Care Algebras and Specifications. 121-142 - Zhaohui Luo:
Program Specification and Data Refinement in Type Theory. 143-168 - Philippe Granger:
Static Analysis of Linear Congruence Equalities among Variables of a Program. 169-192 - Fabrizio Luccio, Linda Pagli:
Simple Solutions for Approximate Tree Matching Problems. 193-201 - Pekka Kilpeläinen, Heikki Mannila:
The Tree Inclusion Problem. 202-214 - Stefano Kasangian, Sebastiano Vigna:
Introducing a Calculus of Trees. 215-240 - Roberto M. Amadio:
Domains in a Realizability Framework. 241-263 - Stephen L. Bloom, Zoltán Ésik:
Iteration Algebras (Extended Abstract). 264-274 - Andrea Corradini, Francesca Rossi, Francesco Parisi-Presicce:
Logic Programming as Hypergraph Rewriting. 275-295 - Frank S. de Boer, Catuscia Palamidessi
:
A Fully Abstract Model for Concurrent Constraint Programming. 296-319 - Maurizio Gabbrielli
, Giorgio Levi:
A Solved Form Algorithm for Ask and Tell Herbrand Constraints. 320-337 - K. V. S. Prasad:
A Calculus of Broadcasting Systems. 338-358 - Elie Najm, Jean-Bernard Stefani:
Object-Based Concurrency: A Process Calculus Analysis. 359-380 - Bengt Jonsson, Kim Guldstrand Larsen:
On the Complexity of Equation Solving in Process Algebra. 381-396 - Franck van Breugel:
Comparative Semantics for a Real-Time Programming Language with Integration. 397-411 - Yolanda Ortega-Mallén, David de Frutos-Escrig
:
A Complete Proof System for Timed Observations. 412-440 - Michael I. Schwartzbach:
Type Inference with Inequalities. 441-455
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.