000 03723nam a22005175i 4500
001 978-0-387-28183-4
003 DE-He213
005 20250710083941.0
007 cr nn 008mamaa
008 100301s2005 xxu| s |||| 0|eng d
020 _a9780387281834
_a99780387281834
024 7 _a10.1007/0-387-28183-5
_2doi
082 0 4 _a005.1015113
_223
100 1 _aPoernomo, Iman Hafiz.
_eauthor.
245 1 0 _aAdapting Proofs-as-Programs
_h[recurso electrónico] :
_bThe Curry-Howard Protocol /
_cby Iman Hafiz Poernomo, Martin Wirsing, John Newsome Crossley.
264 1 _aNew York, NY :
_bSpringer New York,
_c2005.
300 _aXII, 420 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aMonographs in Computer Science,
_x0172-603X
505 0 _aPrologue -- Generalizing Proofs-as-Programs -- Functional Program Synthesis -- The Curry-Howard Protocol -- Imperative Proofs-as-Programs -- Intuitionistic Hoare Logic -- Properties of Intuitionistic Hoare Logic -- Proofs-as-Imperative-Programs -- Structured Proofs-as-Programs -- Reasoning about Structured Specifications -- Proof-theoretic Properties of SSL -- Structured Proofs-as-Programs -- Generic Specifications -- Structured Program Synthesis -- Epilogue -- Conclusions: Toward Constructive Logic as a Practical 4GL.
520 _aThis monograph details several important advances in the area known as the proofs-as-programs paradigm, a set of approaches to developing programs from proofs in constructive logic. It serves the dual purpose of providing a state-of-the-art overview of the field and detailing tools and techniques to stimulate further research. One of the book's central themes is a general, abstract framework for developing new systems of program synthesis by adapting proofs-as-programs to new contexts, which the authors call the Curry--Howard Protocol. This protocol is used to provide two novel applications for industrial-scale, complex software engineering: contractual imperative program synthesis and structured software synthesis. These applications constitute an exemplary justification for the applicability of the protocol to different contexts. The book is intended for graduate students in computer science or mathematics who wish to extend their background in logic and type theory as well as gain experience working with logical frameworks and practical proof systems. In addition, the proofs-as-programs research community, and the wider computational logic, formal methods and software engineering communities will benefit. The applications given in the book should be of interest for researchers working in the target problem domains.
650 0 _aCOMPUTER SCIENCE.
650 0 _aLOGIC DESIGN.
650 0 _aSOFTWARE ENGINEERING.
650 0 _aLOGIC, SYMBOLIC AND MATHEMATICAL.
650 1 4 _aCOMPUTER SCIENCE.
650 2 4 _aLOGICS AND MEANINGS OF PROGRAMS.
650 2 4 _aMATHEMATICAL LOGIC AND FOUNDATIONS.
650 2 4 _aLOGIC DESIGN.
650 2 4 _aPROGRAMMING TECHNIQUES.
650 2 4 _aSOFTWARE ENGINEERING/PROGRAMMING AND OPERATING SYSTEMS.
650 2 4 _aMODELS AND PRINCIPLES.
700 1 _aWirsing, Martin.
_eauthor.
700 1 _aCrossley, John Newsome.
_eauthor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9780387237596
830 0 _aMonographs in Computer Science,
_x0172-603X
856 4 0 _uhttp://dx.doi.org/10.1007/0-387-28183-5
_zVer el texto completo en las instalaciones del CICY
912 _aZDB-2-SCS
942 _2ddc
_cER
999 _c56791
_d56791