default search action
8. CSL 1994: Kazimierz, Poland
Leszek Pacholski, Jerzy Tiuryn:
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
Lambda Calculus
- Viviana Bono, Luigi Liquori:
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects. 16-30 - Hugo Herbelin:
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure. 61-75
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 - 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
- Alexei P. Stolboushkin, Michael A. Taitslin:
Is First Order Contained in an Initial Segment of PTIME? 242-248
Logic Programming
- Valentinas Kriauciukas, Michal Walicki:
Reasoning and Rewriting with Set-Relations I: Ground Completeness. 264-278
Semantics
- Matt Fairtlough, Michael Mendler:
An Intuitionistic Modal Logic with Applications to the Formal Verification of Hardware. 354-368 - David R. Lester, Sava Mintchev:
Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional Languages. 369-381
Category Theory
- 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 - Daniel Leivant, Jean-Yves Marion:
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space. 486-500 - Vladimir Yu. Sazonov:
A Bounded Set Theory with Anti-Foundation Axiom and Inductive Definability. 527-541
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2015-03-01 01:06 CET by the dblp team