TAPSOFT, Vol.1

Keyphrases

Publications

1991

Roberto M. Amadio
Domains in a Realizability Framework. TAPSOFT, Vol.1 (1991)
Frank S. de Boer, Catuscia Palamidessi
A Fully Abstract Model for Concurrent Constraint Programming. TAPSOFT, Vol.1 (1991)
Philippe Granger
Static Analysis of Linear Congruence Equalities among Variables of a Program. TAPSOFT, Vol.1 (1991)
Egidio Astesiano, Maura Cerioli
Non-Strict Don't Care Algebras and Specifications. TAPSOFT, Vol.1 (1991)
Yolanda Ortega-Mallén, David de Frutos-Escrig
A Complete Proof System for Timed Observations. TAPSOFT, Vol.1 (1991)
Stefano Kasangian, Sebastiano Vigna
Introducing a Calculus of Trees. TAPSOFT, Vol.1 (1991)
Andrea Corradini, Francesca Rossi, Francesco Parisi-Presicce
Logic Programming as Hypergraph Rewriting. TAPSOFT, Vol.1 (1991)
Luca Aceto
Full Abstraction for Series-Parallel Pomsets. TAPSOFT, Vol.1 (1991)
Gian Luigi Ferrari
On Causality Observed Incrementally, Finally. TAPSOFT, Vol.1 (1991)
Michael I. Schwartzbach
Type Inference with Inequalities. TAPSOFT, Vol.1 (1991)
Emmanuel Kounalis, Denis Lugiez
Compilation of Pattern Matching with Associative-Commutative Functions. TAPSOFT, Vol.1 (1991)
K. V. S. Prasad
A Calculus of Broadcasting Systems. TAPSOFT, Vol.1 (1991)
Bengt Jonsson, Kim Guldstrand Larsen
On the Complexity of Equation Solving in Process Algebra. TAPSOFT, Vol.1 (1991)
Hubert Baumeister
Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution. TAPSOFT, Vol.1 (1991)
Franck van Breugel
Comparative Semantics for a Real-Time Programming Language with Integration. TAPSOFT, Vol.1 (1991)
Pekka Kilpeläinen, Heikki Mannila
The Tree Inclusion Problem. TAPSOFT, Vol.1 (1991)
Stephen L. Bloom, Zoltán Ésik
Iteration Algebras (Extended Abstract). TAPSOFT, Vol.1 (1991)
Anne-Cécile Caron
Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties. TAPSOFT, Vol.1 (1991)
Elie Najm, Jean-Bernard Stefani
Object-Based Concurrency: A Process Calculus Analysis. TAPSOFT, Vol.1 (1991)
P. M. van den Broek
Algebraic Graph Rewriting Using a Single Pushout. TAPSOFT, Vol.1 (1991)
Zhaohui Luo
Program Specification and Data Refinement in Type Theory. TAPSOFT, Vol.1 (1991)
Marta Z. Kwiatkowska
On the Domain of Traces and Sequential Composition. TAPSOFT, Vol.1 (1991)
Maurizio Gabbrielli, Giorgio Levi
A Solved Form Algorithm for Ask and Tell Herbrand Constraints. TAPSOFT, Vol.1 (1991)
Fabrizio Luccio, Linda Pagli
Simple Solutions for Approximate Tree Matching Problems. TAPSOFT, Vol.1 (1991)

volume 493, 1991

TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Brighton, UK, April 8-12, 1991, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'91) TAPSOFT, Vol.1 493 (1991)

1989

volume 351, 1989

TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Barcelona, Spain, March 13-17, 1989, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'89) TAPSOFT, Vol.1 351 (1989)

volume 249, 1987

TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, Pisa, Italy, March 23-27, 1987, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming (CAAP'87) TAPSOFT, Vol.1 249 (1987)