8. CSL 1994: Kazimierz, Poland

Lambda Calculus

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

Proof Theory

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

Finite Model Theory

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

Logic Programming

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

Semantics

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

Category Theory

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

Other Logical Systems

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