Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Logical Frameworks

Logical Frameworks

Logical Frameworks

Gerard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
G. Plotkin, University of Edinburgh
September 1991
Hardback
9780521413008
£89.99
GBP
Hardback
USD
eBook

    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

    Product details

    September 1991
    Hardback
    9780521413008
    416 pages
    229 × 152 × 27 mm
    0.78kg
    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.
      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