Dirk van Dalen, Marc Bezem
Selected Papers of the 10th International Workshop on Computer Science Logic / Annual Conference of the EACSL
CSL, 1996.

@proceedings{CSL-1996,
	address       = "Utrecht, The Netherlands",
	editor        = "Dirk van Dalen and Marc Bezem",
	isbn          = "3-540-63172-0",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Selected Papers of the 10th International Workshop on Computer Science Logic / Annual Conference of the EACSL}",
	volume        = 1258,
	year          = 1996,
}

Contents (28 items)

4 ×#logic
4 ×#modelling
3 ×#algebra
3 ×#type system
2 ×#bound
2 ×#decidability
2 ×#monad
2 ×#on the
2 ×#problem
2 ×#reduction

CSL-1996-ArieliA #knowledge base

Four-Valued Diagnoses for Stratified Knowledge-Bases (OA, AA), pp. 1–17.

CSL-1996-BaazL #performance

Fast Cut-Elimination by Projection (MB, AL), pp. 18–33.

CSL-1996-BartheM #algebra #on the #reduction #type system

On the Subject Reduction Property for Algebraic Type Systems (GB, PAM), pp. 34–57.

CSL-1996-CattaniW #concurrent #modelling

Presheaf Models for Concurrency (GLC, GW), pp. 58–75.

CSL-1996-DanosPR #reduction

Directed Virtual Reductions (VD, MP, LR), pp. 76–88.

CSL-1996-Dziembowski #bound #fixpoint #query

Bounded-Variable Fixpoint Queries are PSPACE-complete (SD), pp. 89–105.

CSL-1996-EekelenSP #functional #graph grammar #programming language #semantics

Graph Rewriting Semantics for Functional Programming Languages (MCJDvE, SS, MJP), pp. 106–128.

CSL-1996-FioreP #axiom #modelling

An Extension of Models of Axiomatic Domain Theory to Models of Synthetic Domain Theory (MPF, GDP), pp. 129–149.

CSL-1996-GeserMOZ #term rewriting

Relative Undecidability in Term Rewriting (AG, AM, EO, HZ), pp. 150–166.

CSL-1996-Geuvers #dependent type #higher-order #logic #modelling #type system

Extending Models of Second Order Predicate Logic to Models of Second Dependent Type Theory (HG), pp. 167–181.

CSL-1996-Ghani

η-Expansions in Fω (NG), pp. 182–197.

CSL-1996-Gore #algebra #calculus

Cut-free Display Calculi for Relation Algebras (RG), pp. 198–210.

CSL-1996-Imhof #aspect-oriented

Computational Aspects of Arity Hierarchies (HI), pp. 211–225.

CSL-1996-Ingolfsdottir #semantics

Weak Semantics Based on Lighted Button Pressing Experiments (AI), pp. 226–243.

CSL-1996-KozenS #algebra #decidability #testing

Kleene Algebra with Tests: Completeness and Decidability (DK, FS), pp. 244–259.

CSL-1996-KreidlerS #monad

Monadic NP and Built-in Trees (MK, DS), pp. 260–275.

CSL-1996-Luo #type system

Coercive Subtyping in Type Theory (ZL), pp. 276–296.

CSL-1996-Malecki #proving

Proofs in System Fω Can Be Done in System Fω¹ (SM), pp. 297–315.

CSL-1996-Malmstrom #approximate #optimisation #problem

Optimization Problems with Approximation Schemes (AM), pp. 316–333.

CSL-1996-Matzinger #modelling #using

Computational Representations of Herbrand Models Using Grammars (RM), pp. 334–348.

CSL-1996-Merkle #bound

Exact Pairs for Abstract Bounded Reducibilities (WM), pp. 349–368.

CSL-1996-Otto #invariant #logic

The Logic of Explicitly Presentation-Invariant Circuits (MO), pp. 369–384.

CSL-1996-PhilippouW #confluence #social

Social Confluence in Client-Server Systems (AP, DW), pp. 385–398.

CSL-1996-Roversi #resource management #λ-calculus

A Type-Free Resource-Aware λ-Calculus (LR), pp. 399–413.

CSL-1996-Setzer #decidability #induction

Inductive Definitions with Decidable Atomic Formulas (AS), pp. 414–430.

CSL-1996-Stark #call-by #logic

Call-by-Value, Call-by-Name and the Logic of Values (RFS), pp. 431–445.

CSL-1996-Statman #monad #on the

On Cartesian Monoids (RS), pp. 446–459.

CSL-1996-Yashin #logic #problem

New Intuitionistic Logical Constants: Undecidability of the Conservativsness Problem (ADY), pp. 460–471.