Special Issue of Theoretical Computer Science (TCS) Proof-search in Type-theoretic Languages - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Ouvrage (Y Compris Édition Critique Et Traduction) Année : 1998

Special Issue of Theoretical Computer Science (TCS) Proof-search in Type-theoretic Languages

Didier Galmiche
David Pym
  • Fonction : Auteur

Résumé

Algorithmic proof-search is a fundamental enabling technology throughout artificial intelligence and computer science. There is a long history of work in proof-search in a variety of systems of logic, including classical, intuitionistic, relevant, linear and modal systems, at the propositional, first- and higher-order levels. Such work has ranged from the most abstract to the most practical and has employed the full spectrum of logical techniques, from proof theory, model theory and recursion theory. From the computational point of view, the type-theoretic component of logical languages, which may involve propositional, first-order, higher-order or polymorphic assignment regimes, introduces significant challenges for both theoreticians and implementors.
Fichier non déposé

Dates et versions

inria-00098603 , version 1 (25-09-2006)

Identifiants

  • HAL Id : inria-00098603 , version 1

Citer

Didier Galmiche, David Pym. Special Issue of Theoretical Computer Science (TCS) Proof-search in Type-theoretic Languages. Elsevier, 350 p, 1998. ⟨inria-00098603⟩
81 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More