Computer Science Logic: 10th International Workshop, CSL ’96 Annual Conference of the EACSL Utrecht, The Netherlands, September 21–27, 1996 Selected Papers

Ofer Arieli, Arnon Avron (auth.), Dirk van Dalen, Marc Bezem (eds.)3540631720, 9783540631729

This book constitutes the strictly refereed post-workshop proceedings of the 10th International Workshop on Computer Science Logic, CSL’96, held as the 5th Annual Conference of the European Association of Computer Science Logic (EACSL), in Utrecht, The Netherlands, in September 1996.
The volume presents 26 revised full papers selected from a total of initially 75 papers submitted; also included are two refereed invited contributions. The volume addresses all current issues in the area of computer science logic research, and is thus a unique record of recent progress in the area.

---

Table of contents :
Four-valued diagnoses for stratified knowledge-bases….Pages 1-17
Fast cut-elimination by projection….Pages 18-33
On the subject reduction property for algebraic type systems….Pages 34-57
Presheaf models for concurrency….Pages 58-75
Directed virtual reductions….Pages 76-88
Bounded-variable fixpoint queries are PSPACE-complete….Pages 89-105
Graph rewriting semantics for functional programming languages….Pages 106-128
An extension of models of Axiomatic Domain Theory to models of Synthetic Domain Theory….Pages 129-149
Relative undecidability in term rewriting….Pages 150-166
Extending models of second order predicate logic to models of second order dependent type theory….Pages 167-181
Eta-expansions in F ω ….Pages 182-197
Cut-free display calculi for relation algebras….Pages 198-210
Computational aspects of arity hierarchies….Pages 211-225
Weak semantics based on lighted button pressing experiments….Pages 226-243
Kleene algebra with tests: Completeness and decidability….Pages 244-259
Monadic NP and built-in trees….Pages 260-274
Coercive subtyping in type theory….Pages 275-296
Optimization problems with approximation schemes….Pages 297-315
Computational representations of herbrand models using grammars….Pages 316-333
Exact pairs for abstract bounded reducibilities….Pages 334-348
The logic of explicitly presentation-invariant circuits….Pages 349-368
Social confluence in client-server systems….Pages 369-384
A type-free resource-aware λ-calculus….Pages 385-398
Inductive definitions with decidable atomic formulas….Pages 399-413
Call-by-Value, call-by-name and the logic of values….Pages 414-430
On Cartesian monoids….Pages 431-445
New intuitionistic logical constants: Undecidability of the conservativeness problem….Pages 446-459
….Pages 460-471