Logical Environments
Published on 16. September 1993
Book
Hardback
352 pages
978-0-521-43312-9 (ISBN)
Description
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.
Reviews / Votes
"The research of logical frameworks probably has a long future ahead, and the reviewed volume provides truthful information about the first steps into this wide field." Journal of Symbolic LogicMore details
Language
English
Place of publication
Cambridge
United Kingdom
Target group
Professional and scholarly
Dimensions
Height: 235 mm
Width: 156 mm
Thickness: 21 mm
Weight
640 gr
ISBN-13
978-0-521-43312-9 (9780521433129)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Classification
Persons
Content
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.