Workshop on Proof search in type-theoretic languages (in conjunction with CADE-15 conference), Lindau, Germany, July 5, 1998 (Q1273566)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Delzanno, Giorgio}, Specification of term rewriting in linear logic, electronic paper No. 2 [Zbl 0917.68111] \textit{Egly, Uwe; Schmitt, Stephann}, Intuitionistic proof transformations: Complexity and applications, electronic paper No. 3 [Zbl 0917.68195] \textit{Franssen, Michael}, Embedding first-order tableaux into a pure type system, electronic paper No. 4 [Zbl 0917.68194] \textit{Galmiche, Didier; Martin, Bruno}, Proof nets construction and automated deduction in non-commutative linear logic. (Extended abstract), electronic paper No. 5 [Zbl 0917.68199] \textit{Larchey-Wendling, Dominique; Galmiche, Didier}, Provability in intuitionistic linear logic from a new interpretation on Petri nets. (Extended abstract), electronic paper No. 6 [Zbl 0917.68158] \textit{Pfenning, Frank; Schürmann, Carsten}, Algorithms for equality and unification in the presence of notational definitions, electronic paper No. 7 [Zbl 0917.68200] \textit{Pinto, Luis; Dyckhoff, Roy}, Sequent calculi for the normal terms of the \(\lambda\Pi\) and \(\lambda\Pi\Sigma\) calculi, electronic paper No. 8 [Zbl 0917.68198] \textit{Pym, David J.}, Logic programming with bunched implications. (Extended abstract), electronic paper No. 9 [Zbl 0917.68042]