8. CSL 1994: Kazimierz, Poland

Leszek Pacholski, Jerzy Tiuryn (Eds.): Computer Science Logic, 8th International Workshop, CSL '94, Kazimierz, Poland, September 25-30, 1994, Selected Papers. Lecture Notes in Computer Science 933 Springer 1995, ISBN 3-540-60017-5 BibTeX

@proceedings{DBLP:conf/csl/1994,
  editor    = {Leszek Pacholski and
               Jerzy Tiuryn},
  title     = {Computer Science Logic, 8th International Workshop, CSL '94,
               Kazimierz, Poland, September 25-30, 1994, Selected Papers},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {933},
  year      = {1995},
  isbn      = {3-540-60017-5},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Lambda Calculus

David Aspinall: Subtyping with Singleton Types. 1-15 BibTeX
Viviana Bono, Luigi Liquori: A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects. 16-30 BibTeX
Torben Braüner: The Girard Translation Extended with Recursion. 31-45 BibTeX
Adriana B. Compagnoni: Decidability of Higher-Order Subtyping with Intersection Types. 46-60 BibTeX
Hugo Herbelin: A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure. 61-75 BibTeX
Jan Kuper: Usability: Formalising (Un)definedness in Typed Lambda Calculus. 76-90 BibTeX
Marek Zaionc: Lambda Representation of Operations Between Fifferent Term Algebras. 91-105 BibTeX

Proof Theory

Matthias Baaz, Gernot Salzer: Semi-Unification and Generalizations of a Particularly Simple Form. 106-120 BibTeX
P. N. Benton: A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract). 121-135 BibTeX
Lew Gordeev: Cut Free Formalization of Logic with Finitely Many Variables. Part I. 136-150 BibTeX
Pavel Pudlák, Samuel R. Buss: How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. 151-162 BibTeX

Finite Model Theory

Bruno Courcelle: Monadic Second-Order Logic and Linear Orderings of Finite Structures. 163-176 BibTeX
Arnaud Durand, Solomampionona Ranaivoson: First-Order Spectra with One Binary Predicate. 177-189 BibTeX
Etienne Grandjean, Frédéric Olive: Monadic Logical Definability of NP-Complete Problems. 190-204 BibTeX
Clemens Lautemann, Thomas Schwentick, Denis Thérien: Logics For Context-Free Languages. 205-216 BibTeX
Anders Malmström: Log-Approximable Minimization Problems on Random Inputs. 217-227 BibTeX
Monica McArthur: Convergence and 0-1 Laws for L_inf, omega^k under Arbitrary Measures. 228-241 BibTeX
Alexei P. Stolboushkin, Michael A. Taitslin: Is First Order Contained in an Initial Segment of PTIME? 242-248 BibTeX

Logic Programming

Stacy E. Finkelstein, Peter J. Freyd, James Lipton: Logic Programming in Tau Categories. 249-263 BibTeX
Valentinas Kriauciukas, Michal Walicki: Reasoning and Rewriting with Set-Relations I: Ground Completeness. 264-278 BibTeX
Hans de Nivelle: Resolution Games and Non-Liftable Resolution Orderings. 279-293 BibTeX
Klaus U. Schulz: On Existential Theories of List Concatenation. 294-308 BibTeX
Tanel Tammet: Completeness of Resolution for Definite Answers with Case Analysis. 309-323 BibTeX
Paul J. Voda: Subrecursion as a Basis for a Feasible Programming Language. 324-338 BibTeX

Semantics

Roy L. Crole, Andrew D. Gordon: A Sound Metalogical Semantics for Input/Output Effects. 339-353 BibTeX
Matt Fairtlough, Michael Mendler: An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware. 354-368 BibTeX
David Lester, Sava Mintchev: Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional Languages. 369-381 BibTeX
Yiannis N. Moschovakis, Glen T. Whitney: Powerdomains, Powerstructures and Fairness. 382-396 BibTeX
Frank Piessens, Eric Steegmans: Canonical Forms for Data-Specifications. 397-411 BibTeX

Category Theory

Claudio Hermida, Bart Jacobs: An Algebraic View of Structural Induction. 412-426 BibTeX
Martin Hofmann: On the Interpretation of Type Theory in Locally Cartesian Closed Categories. 427-441 BibTeX

Other Logical Systems

Alexander V. Chagrov, Valentin B. Shehtman: Algorithmic Aspects of Propositional Tense Logics. 442-455 BibTeX
Pawel Cholewinski: Stratified Default Theories. 456-470 BibTeX
Nils Klarlund: A Homomorphism Concepts for omega-Regularity. 471-485 BibTeX
Daniel Leivant, Jean-Yves Marion: Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. 486-500 BibTeX
Hrant B. Marandjian: General Form Recursive Equations I. 501-511 BibTeX
Vladimir V. Rybakov: Modal Logics Preserving Admissible for S4 Inference Rules. 512-526 BibTeX
Vladimir Yu. Sazonov: A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability. 527-541 BibTeX