Skip to Main content Skip to Navigation
Journal articles

Proof-search in Type-theoretic Languages: An Introduction

Didier Galmiche 1 David Pym
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00099225
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 8:51:58 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM

Identifiers

  • HAL Id : inria-00099225, version 1

Collections

Citation

Didier Galmiche, David Pym. Proof-search in Type-theoretic Languages: An Introduction. Theoretical Computer Science, Elsevier, 2000, 232 (1-2), pp.5-53. ⟨inria-00099225⟩

Share

Metrics

Record views

118