Proof-search in Type-theoretic Languages: An Introduction - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2000

Proof-search in Type-theoretic Languages: An Introduction

Didier Galmiche
David Pym
  • Function : Author


We introduce the main concepts and problems in the theory of proof-search in type-theoretic languages and survey some specific, connected topics. We do not claim to cover all of the theoretical and implementation issues in the study of proof-search in type-theoretic languages; rather, we present some key ideas and problems, starting from well-motivated points of departure such as a definition of a type-theoretic language or the relationship between languages and proof-objects. The strong connections between different proof-search methods in logics, type theories and logical frameworks, together with their impact on programming and implementation issues, are central in this context.

Dates and versions

inria-00099225 , version 1 (26-09-2006)



Didier Galmiche, David Pym. Proof-search in Type-theoretic Languages: An Introduction. Theoretical Computer Science, 2000, 232 (1-2), pp.5-53. ⟨10.1016/S0304-3975(99)00169-3⟩. ⟨inria-00099225⟩
35 View
0 Download



Gmail Facebook Twitter LinkedIn More