default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3rd Proof Search in Type-Theoretic Languages@CADE 1998: Lindau, Germany
- Didier Galmiche:
Workshop on Proof Search in Type-Theoretic Languages (in conjunction with CADE-15 Conference), Lindau, Germany, July 5, 1998. Electronic Notes in Theoretical Computer Science 17, Elsevier 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 - Luís 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-18 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
