Volume 17, 1998

Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference)
Lindau, Germany, 5 July 1998

• 
  Didier Galmiche: Preface. 1-2
• 
  Uwe Egly, Stephan Schmitt: Intuitionistic Proof Transformations: Complexity and Applications. 1-12
• 
  Michael Franssen: Embedding First-Order Tableaux into a Pure Type System. 1-23
• 
  Didier Galmiche, Bruno Martin: Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic. 1-20
• 
  Dominique Larchey-Wendling, Didier Galmiche: Provability in Intuitionistic Linear Logic from a New Interpretation on Petri nets. 1-18
• 
  Frank Pfenning, Carsten Schürmann: Algorithms for Equality and Unification in the Presence of Notational Definitions. 1-13
• 
  Luis Pinto, Roy Dyckhoff: Sequent Calculi for the Normal Terms of the - and - Calculi. 1-14
• 
  David J. Pym: Logic Programming with Bunched Implications. 1-24