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 Environments

Logical Environments

Logical Environments

Gerard Huet, Institut National de Recherche en Informatique et en Automatique (INRIA), Rocquencourt
Gordon Plotkin, University of Edinburgh
September 1993
Hardback
9780521433129
Out of Print
Hardback

    In Logical Frameworks, Huet and Plotkin gathered contributions from the first International Workshop on Logical Frameworks. This volume has grown from the second workshop, and as before the contributions are of the highest calibre. Four main themes are covered: the general problem of representing formal systems in logical frameworks, basic algorithms of general use in proof assistants, logical issues, and large-scale experiments with proof assistants. Any mathematician or computer scientist whose research interests lie in the development of the interplay between logic and software engineering will not be able to do without this book.

    • Follow up to Logical Frameworks
    • State of the art contributions

    Product details

    September 1993
    Hardback
    9780521433129
    352 pages
    235 × 156 × 21 mm
    0.64kg
    Unavailable - out of print February 2009

    Table of Contents

    • 1. Metalogical frameworks David A. Basin and Robert L. Constable
    • 2. Encoding of data types in pure construction calculus: a semantic justification Stefano Berardi
    • 3. Experience with FS0 as a framework theory Sean Matthews, Alan Smaill and David Basin
    • 4. Logical support for modularisation Razvan Diaconescu, Joseph Goguen and Petros Stefaneas
    • 5. Algorithmic definition of lambda-typed lambda calculus N. G. De Bruijn
    • 6. A canonical calculus of residuals Yves Bertot
    • 7. Order sorted polymorphism in Isabelle Tobias Nipkow
    • 8. An interpretation of Kleene's slash in type theory Jan Smith
    • 9. Inductive data types: well orderings revisited Healfdene Goguen and Zhaohui Luo
    • 10. Witness extraction in classical logic through normalization Franco Barbanera and Stefano Berardi
    • 11. Finding the answers in classical proofs: a unifying framework Chetan A. Murthy
    • 12. Church-Rosser property in classical free deduction Michel Parigot
    • 13. Completing the rationals and metric spaces in LEGO Clair Jones
    • 14. A machine checked proof that Ackermann's function is not primitive recursive Nora Szasz.
      Contributors
    • David A. Basin, Robert L. Constable, Stefano Berardi, Sean Matthews, Alan Smaill, Razvan Diaconescu, Joseph Goguen, Petros Stafaneas, N. G. de Bruijn, Yves Bertot, Tobias Nipkow, Jan Smith, Healfdene Goguen, Zhaohui Luo, Franco Barbarera, Chetan A. Murthy, Michel Parigot, Clair Jones, Nora Szasz