default search action
Search dblp for Publications
export results for "toc:db/conf/tapsoft/tapsoft91-1.bht:"
@inproceedings{DBLP:conf/tapsoft/Aceto91, author = {Luca Aceto}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Full Abstraction for Series-Parallel Pomsets}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {1--25}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_1}, doi = {10.1007/3-540-53982-4\_1}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Aceto91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Amadio91, author = {Roberto M. Amadio}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Domains in a Realizability Framework}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {241--263}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_14}, doi = {10.1007/3-540-53982-4\_14}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Amadio91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/AstesianoC91, author = {Egidio Astesiano and Maura Cerioli}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Non-Strict Don't Care Algebras and Specifications}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {121--142}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_8}, doi = {10.1007/3-540-53982-4\_8}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/AstesianoC91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Baumeister91, author = {Hubert Baumeister}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Unifying Initial and Loose Semantics of Parameterized Specifications in an Arbitrary Institution}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {103--120}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_7}, doi = {10.1007/3-540-53982-4\_7}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Baumeister91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/BloomE91, author = {Stephen L. Bloom and Zolt{\'{a}}n {\'{E}}sik}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Iteration Algebras (Extended Abstract)}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {264--274}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_15}, doi = {10.1007/3-540-53982-4\_15}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/BloomE91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/BoerP91, author = {Frank S. de Boer and Catuscia Palamidessi}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {A Fully Abstract Model for Concurrent Constraint Programming}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {296--319}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_17}, doi = {10.1007/3-540-53982-4\_17}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/BoerP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Breugel91, author = {Franck van Breugel}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Comparative Semantics for a Real-Time Programming Language with Integration}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {397--411}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_22}, doi = {10.1007/3-540-53982-4\_22}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Breugel91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Broek91, author = {P. M. van den Broek}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Algebraic Graph Rewriting Using a Single Pushout}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {90--102}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_6}, doi = {10.1007/3-540-53982-4\_6}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Broek91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Caron91, author = {Anne{-}C{\'{e}}cile Caron}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {74--89}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_5}, doi = {10.1007/3-540-53982-4\_5}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Caron91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/CorradiniRP91, author = {Andrea Corradini and Francesca Rossi and Francesco Parisi{-}Presicce}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Logic Programming as Hypergraph Rewriting}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {275--295}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_16}, doi = {10.1007/3-540-53982-4\_16}, timestamp = {Tue, 23 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tapsoft/CorradiniRP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Ferrari91, author = {Gian{-}Luigi Ferrari}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {On Causality Observed Incrementally, Finally}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {26--41}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_2}, doi = {10.1007/3-540-53982-4\_2}, timestamp = {Fri, 23 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Ferrari91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/GabbrielliL91, author = {Maurizio Gabbrielli and Giorgio Levi}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {A Solved Form Algorithm for Ask and Tell Herbrand Constraints}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {320--337}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_18}, doi = {10.1007/3-540-53982-4\_18}, timestamp = {Sat, 09 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/GabbrielliL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Granger91, author = {Philippe Granger}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Static Analysis of Linear Congruence Equalities among Variables of a Program}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {169--192}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_10}, doi = {10.1007/3-540-53982-4\_10}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Granger91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/JonssonL91, author = {Bengt Jonsson and Kim Guldstrand Larsen}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {On the Complexity of Equation Solving in Process Algebra}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {381--396}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_21}, doi = {10.1007/3-540-53982-4\_21}, timestamp = {Tue, 31 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/JonssonL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/KasangianV91, author = {Stefano Kasangian and Sebastiano Vigna}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Introducing a Calculus of Trees}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {215--240}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_13}, doi = {10.1007/3-540-53982-4\_13}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/KasangianV91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/KilpelainenM91, author = {Pekka Kilpel{\"{a}}inen and Heikki Mannila}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {The Tree Inclusion Problem}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {202--214}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_12}, doi = {10.1007/3-540-53982-4\_12}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/KilpelainenM91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/KounalisL91, author = {Emmanuel Kounalis and Denis Lugiez}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Compilation of Pattern Matching with Associative-Commutative Functions}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {57--73}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_4}, doi = {10.1007/3-540-53982-4\_4}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/KounalisL91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Kwiatkowska91, author = {Marta Z. Kwiatkowska}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {On the Domain of Traces and Sequential Composition}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {42--56}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_3}, doi = {10.1007/3-540-53982-4\_3}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Kwiatkowska91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/LuccioP91, author = {Fabrizio Luccio and Linda Pagli}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Simple Solutions for Approximate Tree Matching Problems}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {193--201}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_11}, doi = {10.1007/3-540-53982-4\_11}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/LuccioP91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Luo91, author = {Zhaohui Luo}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Program Specification and Data Refinement in Type Theory}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {143--168}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_9}, doi = {10.1007/3-540-53982-4\_9}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Luo91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/NajmS91, author = {Elie Najm and Jean{-}Bernard Stefani}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Object-Based Concurrency: {A} Process Calculus Analysis}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {359--380}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_20}, doi = {10.1007/3-540-53982-4\_20}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/NajmS91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Ortega-MallenF91, author = {Yolanda Ortega{-}Mall{\'{e}}n and David de Frutos{-}Escrig}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {A Complete Proof System for Timed Observations}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {412--440}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_23}, doi = {10.1007/3-540-53982-4\_23}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Ortega-MallenF91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Prasad91, author = {K. V. S. Prasad}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {A Calculus of Broadcasting Systems}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {338--358}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_19}, doi = {10.1007/3-540-53982-4\_19}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Prasad91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tapsoft/Schwartzbach91, author = {Michael I. Schwartzbach}, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {Type Inference with Inequalities}, booktitle = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, pages = {441--455}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4\_24}, doi = {10.1007/3-540-53982-4\_24}, timestamp = {Fri, 19 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/Schwartzbach91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/tapsoft/1991-1, editor = {Samson Abramsky and T. S. E. Maibaum}, title = {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)}, series = {Lecture Notes in Computer Science}, volume = {493}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-53982-4}, doi = {10.1007/3-540-53982-4}, isbn = {3-540-53982-4}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/1991-1.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.