## Computer Science Logic: 8th Workshop, CSL '94, Kazimierz, Poland, September 25 - 30, 1994. Selected PapersLeszek Pacholski, Jerzy Tiuryn This volume contains revised refereed versions of the best papers presented during the CSL '94 conference, held in Kazimierz, Poland in September 1994; CSL '94 is the eighth event in the series of workshops held for the third time as the Annual Conference of the European Association for Computer Science Logic. The 38 papers presented were selected from a total of 151 submissions. All important aspects of the methods of mathematical logic in computer science are addressed: lambda calculus, proof theory, finite model theory, logic programming, semantics, category theory, and other logical systems. Together, these papers give a representative snapshot of the area of logical foundations of computer science. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Other editions - View all

### Common terms and phrases

A-calculus algebra algorithm antichain Arec-calculus argument arity arrows atoms axioms binary binary relation bisimulation boolean bound canonical cartesian closed cartesian closed category clause closed category closed term co-cover coalgebras comonad complete Computer Science congruence consider constant construction contains context Corollary corresponding defined definition denote derivation domain elements equations equivalent example exists expressions extension fibration finite set first-order fixpoint fixpoint operator formula free coalgebras function symbols functor given graph Hence implies induction integer interpretation intuitionistic intuitionistic logic isomorphism labeled lambda calculus language Lemma linear order literals logic programming method modal logic monadic monoidal morphism natural deduction natural numbers normal form object obtained operational semantics pair polynomial predicate symbols problem proof Proposition provable prove pullback quantifier recursive reduction relation resolution game restriction result rewriting RPCn satisfies semantics sequent sequent calculus solution solvable specification structure subset substitution subtyping Theorem tree unary variables