Logical Frameworks

Inbunden, Engelska, 1991

1 659 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum1991-09-26
Mått152 x 229 x 27 mm
Vikt780 g
FormatInbunden
SpråkEngelska
Antal sidor416
FörlagCambridge University Press
ISBN9780521413008

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programspråk inom Data och IT

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.