## Proof-search in type-theoretic languages: an introduction (2000)

### Cached

### Download Links

- [www.loria.fr]
- [www.loria.fr]
- [www.dcs.qmw.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | Theoretical Computer Science |

Citations: | 2 - 1 self |

### BibTeX

@INPROCEEDINGS{Galmiche00proof-searchin,

author = {Didier Galmiche and David J. Pym},

title = {Proof-search in type-theoretic languages: an introduction },

booktitle = { Theoretical Computer Science},

year = {2000},

pages = {5--53},

publisher = {}

}

### OpenURL

### 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.