000			01738nam a22001937a 4500
005			20250706121631.0
008			250706b |||||||| |||| 00| 0 eng d
020			_a9780817640323 _qhbk
041			_aeng
082			_a005.13 _bPRE
100			_aChristian Prehofer
245			_aSolving Higher-order Equations _b: from logic to programming _cChristian Prehofer
260			_aBoston _b Birkhauser _c1998
300			_avii; 186 p. _c24 cm.,
504			_aBib and Ref
520			_aThis monograph develops techniques for equational reasoning in higher-order logic. Due to its expressiveness, higher-order logic is used for specification and verification of hardware, software, and mathematics. In these applica­ tions, higher-order logic provides the necessary level of abstraction for con­ cise and natural formulations. The main assets of higher-order logic are quan­ tification over functions or predicates and its abstraction mechanism. These allow one to represent quantification in formulas and other variable-binding constructs. In this book, we focus on equational logic as a fundamental and natural concept in computer science and mathematics. We present calculi for equa­ tional reasoning modulo higher-order equations presented as rewrite rules. This is followed by a systematic development from general equational rea­ soning towards effective calculi for declarative programming in higher-order logic and A-calculus. This aims at integrating and generalizing declarative programming models such as functional and logic programming. In these two prominent declarative computation models we can view a program as a logical theory and a computation as a deduction
650			_aProgrammation Déclarative
942			_cREF
999			_c574887 _d574887