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). 1st ed. 1991

種類:

電子ブック

責任表示:

edited by S. Abramsky, T.S.E. Maibaum

出版情報:

Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1991

著者名:

• Abramsky, S.
• Maibaum, T.S.E.
• SpringerLink (Online service)

シリーズ名:

Lecture Notes in Computer Science ; 493

ISBN:

9783540465638 [3540465634]    

注記:

Full abstraction for series-parallel pomsets -- On causality observed incrementally, finally -- On the domain of traces and sequential composition -- Compilation of pattern matching with associative-commutative functions -- Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties -- Algebraic graph rewriting using a single pushout -- Unifying initial and loose semantics of parameterized specifications in an arbitrary institution -- Non-strict don't care algebras and specifications -- Program specification and data refinement in type theory -- Static analysis of linear congruence equalities among variables of a program -- Simple solutions for approximate tree matching problems -- The tree inclusion problem -- Introducing a calculus of trees -- Domains in a realizability framework -- Iteration algebras extended abstract -- Logic programming as hypergraph Rewriting -- A fully abstract model for concurrent constraint programming -- A solved form algorithm for ask an
TAPSOFT '91 is the Fourth International Joint Conference on Theory and Practice of Software Development. It was held in Brighton, April 8-12, 1991, and was organized by the Department of Computing, Imperial College, London. The proceedings of TAPSOFT '91 are organized into three parts: - Colloquium on Trees in Algebra and Programming (CAAP); - Advances in Distributed Computing (ADC); - Colloquium on Combining Paradigms for Software Development (CCPSD). The first part (CAAP) is contained in Vol. 1, the other two parts constitute Vol. 2. CAAP '91 focuses on the following topics: - Logical, algebraic and combinatorial properties of discrete structures (strings, trees, graphs, etc.), including the theory of formal languages considered in the broad sense as that of sets of discrete structures and the theory of rewriting systems over them. - Application of discrete structures in computer science: syntax and semantics of programming languages, operational semantics, logic programming, algorithms and data structures,

ローカル注記:

学内専用E-BOOKS (local access only)