Cart

Unlocking potential with the best learning and research solutions

Logical Frameworks

£89.99

Editors:
Gerard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
G. Plotkin, University of Edinburgh

P. Aczel, D. Carlisle, D. Basin, M. Kaufmann, S. Beradi, N. de Bruijn, R. Burstall, J. McKinna, R. Constable, C. Murthy, T. Coquand, G. Dowek, P. Dybjer, A. Felty, D. Miller, P. de Groote, L. Hallnäs, L. Helmink, E. Pfenning, D. Pym, L. Wallen, P. Schroeder-Heister

View all contributors

Date Published: September 1991
availability: Available
format: Hardback
isbn: 9780521413008

Rate & review

£ 89.99
Hardback

Add to cart Add to wishlist

Other available formats:
eBook

Looking for an inspection copy?

This title is not currently available on inspection

Description

Contents

Resources

Courses

About the Authors

This 1991 volume contains the proceedings of the first international workshop on Logical Frameworks. The contributions are concerned with the application of logical reasoning and proof theory in computer science and its relevance to automatic theorem proving, and consequently topics such as artificial intelligence. It is the only source for much of this material and will be a necessary purchase for mathematicians and computer scientists undertaking research at the interface of logic and software engineering.
- Follow up to Logical Frameworks
- State of the art contributions
Read more
Customer reviews

Not yet reviewed
Be the first to review

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- Date Published: September 1991
- format: Hardback
- isbn: 9780521413008
- length: 416 pages
- dimensions: 229 x 152 x 27 mm
- weight: 0.78kg
- availability: Available
Table of Contents
1. The logical theory of constructions P. Aczel and D. Carlisle
2. The Boyer-Moore theorem prover and Nuprl: an experimental comparison D. Basin and M. Kaufmann
3. Girard normalisation proof in LEGO S. Beradi
4. A plea for weaker frameworks N. de Bruijn
5. Deliverables: an approach to program development in the Calculus of Constructions R. Burstall and J. McKinna
6. Finding computational content in classical proofs R. Constable and C. Murthy
7. An algorithm for testing conversion in type theory T. Coquand
8. A proof synthesis algorithm for testing conversion in type theory G. Dowek
9. Inductive sets and families in Martin-Löf's type theory and their set-theoretic semantics P. Dybjer
10. Encoding a dependent-type lambda-calculus in a logic A. Felty and D. Miller
11. Nederpelt's calculus extended with a notion of context as a logical framework P. de Groote
12. Models of partial induction L. Hallnäs
13. Goal-directed proof construction in type theory L. Helmink
14. Elf: a language for logic definition and verified meta-programming E. Pfenning
15. Investigations into proof-search in a system of first-order dependent function types D. Pym and L. Wallen
16. The role of elimination inferences in a structural framework P. Schroeder-Heister.
Editors
Gerard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
G. Plotkin, University of Edinburgh
Contributors
P. Aczel, D. Carlisle, D. Basin, M. Kaufmann, S. Beradi, N. de Bruijn, R. Burstall, J. McKinna, R. Constable, C. Murthy, T. Coquand, G. Dowek, P. Dybjer, A. Felty, D. Miller, P. de Groote, L. Hallnäs, L. Helmink, E. Pfenning, D. Pym, L. Wallen, P. Schroeder-Heister