10. CSL 1996: Utrecht, The Netherlands

@proceedings{DBLP:conf/csl/1996,
  editor    = {Dirk van Dalen and
               Marc Bezem},
  title     = {Computer Science Logic, 10th International Workshop, CSL '96,
               Annual Conference of the EACSL, Utrecht, The Netherlands, September
               21-27, 1996, Selected Papers},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1258},
  year      = {1997},
  isbn      = {3-540-63172-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Ofer Arieli, Arnon Avron: Four-Valued Diagnoses for Stratified Knowledge-Bases. 1-17 BibTeX
• Matthias Baaz, Alexander Leitsch: Fast Cut-Elimination by Projection. 18-33 BibTeX
• Gilles Barthe, Paul-André Melliès: On the Subject Reduction Property for Algebraic Type Systems. 34-57 BibTeX
• Gian Luca Cattani, Glynn Winskel: Presheaf Models for Concurrency. 58-75 BibTeX
• Vincent Danos, Marco Pedicini, Laurent Regnier: Directed Virtual Reductions. 76-88 BibTeX
• Stefan Dziembowski: Bounded-Variable Fixpoint Queries are PSPACE-complete. 89-105 BibTeX
• Marko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer: Graph Rewriting Semantics for Functional Programming Languages. 106-128 BibTeX
• Marcelo P. Fiore, Gordon D. Plotkin: An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory. 129-149 BibTeX
• Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. 150-166 BibTeX
• Herman Geuvers: Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory. 167-181 BibTeX
• Neil Ghani: Eta-Expansions in F^omega. 182-197 BibTeX
• Rajeev Goré: Cut-free Display Calculi for Relation Algebras. 198-210 BibTeX
• Henrik Imhof: Computational Aspects of Arity Hierarchies. 211-225 BibTeX
• Anna Ingólfsdóttir: Weak Semantics Based on Lighted Button Pressing Experiments. 226-243 BibTeX
• Dexter Kozen, Frederick Smith: Kleene Algebra with Tests: Completeness and Decidability. 244-259 BibTeX
• Martin Kreidler, Detlef Seese: Monadic NP and Built-in Trees. 260-275 BibTeX
• Zhaohui Luo: Coercive Subtyping in Type Theory. 276-296 BibTeX
• Sophie Malecki: Proofs in System F_omega Can Be Done in System F_omega¹. 297-315 BibTeX
• Anders Malmström: Optimization Problems with Approximation Schemes. 316-333 BibTeX
• Robert Matzinger: Computational Representations of Herbrand Models Using Grammars. 334-348 BibTeX
• Wolfgang Merkle: Exact Pairs for Abstract Bounded Reducibilities. 349-368 BibTeX
• Martin Otto: The Logic of Explicitly Presentation-Invariant Circuits. 369-384 BibTeX
• Anna Philippou, David Walker: Social Confluence in Client-Server Systems. 385-398 BibTeX
• Luca Roversi: A Type-Free Resource-Aware Lambda-Calculus. 399-413 BibTeX
• Anton Setzer: Inductive Definitions with Decidable Atomic Formulas. 414-430 BibTeX
• Robert F. Stärk: Call-by-Value, Call-by-Name and the Logic of Values. 431-445 BibTeX
• Richard Statman: On Cartesian Monoids. 446-459 BibTeX
• A. D. Yashin: New Intuitionistic Logical Constants: Undecidability of the Conservativsness Problem. 460-471 BibTeX