Computer science logic. 10th international workshop, CSL '96. Annual conference of the EACSL, Utrecht, the Netherlands. September 21--27, 1996. Selected papers (Q1362744)

The articles of mathematical interest will be reviewed individually. The preceding conference (9, 1995) has been reviewed (see Zbl 0851.00042). Indexed articles: \textit{Baaz, Matthias; Leitsch, Alexander}, Fast cut-elimination by projection, 18-33 [Zbl 0889.03048] \textit{Barthe, G.; Melliès, P.-A.}, On the subject reduction property for algebraic type systems, 34-57 [Zbl 0882.03010] \textit{Cattani, Gian Luca; Winskel, Glynn}, Presheaf models for concurrency, 58-75 [Zbl 0881.18013] \textit{Danos, Vincent; Pedicini, Marco; Regnier, Laurent}, Directed virtual reductions, 76-88 [Zbl 0889.68022] \textit{Dziembowski, Stefan}, Bounded-variable fixpoint queries are PSPACE-complete, 89-105 [Zbl 0889.68051] \textit{van Eekelen, Marko; Smetsers, Sjaak; Plasmeijer, Rinus}, Graph rewriting semantics for functional programming languages, 106-128 [Zbl 0884.68079] \textit{Fiore, Marcelo P.; Plotkin, Gordon D.}, An extension of models of axiomatic domain theory to models of synthetic domain theory, 129-149 [Zbl 0884.18009] \textit{Geser, Alfons; Middeldorp, Aart; Ohlebusch, Enno; Zantema, Hans}, Relative undecidability in term rewriting, 150-166 [Zbl 0884.68067] \textit{Geuvers, Herman}, Extending models of second order predicate logic to models of second order dependent type theory, 167-181 [Zbl 0881.03005] \textit{Ghani, Neil}, Eta-expansions in \(F^ \omega\), 182-197 [Zbl 0881.03010] \textit{Goré, Rajeev}, Cut-free display calculi for relation algebras, 198-210 [Zbl 0881.03040] \textit{Imhof, Henrik}, Computational aspects of arity hierarchies, 211-225 [Zbl 0894.03019] \textit{Ingólfsdóttir, Anna}, Weak semantics based on lighted button pressing experiments. An alternative characterization of the readiness semantics, 226-243 [Zbl 0889.68100] \textit{Kozen, Dexter; Smith, Frederick}, Kleene algebra with tests: Completeness and decidability, 244-259 [Zbl 0882.03064] \textit{Kreidler, Martin; Seese, Detlef}, Monadic NP and built-in trees, 260-274 [Zbl 0888.03026] \textit{Luo, Zhaohui}, Coercive subtyping in type theory, 273-296 [Zbl 0882.03029] \textit{Malecki, Sophie}, Proofs in system \(F_ \omega\) can be done in system \(F_ \omega^ 1\), 297-315 [Zbl 0884.03007] \textit{Malmström, Anders}, Optimization problems with approximation schemes, 316-333 [Zbl 0878.90105] \textit{Matzinger, Robert}, Computational representations of Herbrand models using grammars, 334-348 [Zbl 0881.03009] \textit{Merkle, Wolfgang}, Exact pairs for abstract bounded reducibilities, 349-368 [Zbl 0882.03043] \textit{Otto, Martin}, The logic of explicitly presentation-invariant circuits, 369-384 [Zbl 0889.03021] \textit{Philippou, Anna; Walker, David}, Social confluence in client-server systems, 385-398 [Zbl 0884.68051] \textit{Roversi, Luca}, A type-free resource-aware \(\lambda\)-calculus, 399-413 [Zbl 0887.03009] \textit{Setzer, Anton}, Inductive definitions with decidable atomic formulas, 414-430 [Zbl 0881.03034] \textit{Stärk, Robert F.}, Call-by-value, call-by-name and the logic of values, 431-445 [Zbl 0881.03019] \textit{Statman, Rick}, On Cartesian monoids, 446-459 [Zbl 0882.03063] \textit{Yashin, A. D.}, New intuitionistic logical constants: Undecidability of the conservativeness problem, 460-471 [Zbl 0881.03007]