A grammatical view of logic programming / Pierre Deransart and Jan Małuszyński.
نوع المادة : نصالسلاسل:Logic programmingالناشر:Cambridge, Mass. : MIT Press, [1993]تاريخ حقوق النشر: ©1993وصف:xxxi, 454 pages : illustrations ; 25 cmنوع المحتوى:- text
- unmediated
- volume
- 0262041405
- 9780262041409
- 9780262514446
- 0262514443
- 9780262290845
- 0262290847
- QA76.63 .D47 1993
نوع المادة | المكتبة الحالية | رقم الطلب | رقم النسخة | حالة | تاريخ الإستحقاق | الباركود | |
---|---|---|---|---|---|---|---|
كتاب | UAE Federation Library | مكتبة اتحاد الإمارات General Collection | المجموعات العامة | QA76.63 .D47 1993 (إستعراض الرف(يفتح أدناه)) | C.1 | Library Use Only | داخل المكتبة فقط | 30010011102981 | ||
كتاب | UAE Federation Library | مكتبة اتحاد الإمارات General Collection | المجموعات العامة | QA76.63 .D47 1993 (إستعراض الرف(يفتح أدناه)) | C.2 | المتاح | 30010011102982 |
Browsing UAE Federation Library | مكتبة اتحاد الإمارات shelves, Shelving location: General Collection | المجموعات العامة إغلاق مستعرض الرف(يخفي مستعرض الرف)
QA76.625 S557 1998 The complete guide to Java database programming / | QA76.625 W57 1999 Network programming with Microsoft Visual J++ 6.0 [multimedia] / | QA76.63 .D47 1993 A grammatical view of logic programming / | QA76.63 .D47 1993 A grammatical view of logic programming / | QA76.63 .F367 2013 Just enough programming logic and design / | QA76.63 .F37 2013 A beginner's guide to programming logic and design : introductory version / | QA76.63 .F37 2013 A beginner's guide to programming logic and design : introductory version / |
Includes bibliographical references (pages 431-443) and index.
Foreword / J.H. Gallier -- 1. Preliminaries -- 1.1. Relations -- 1.2. Formal languages and context-free grammars -- 1.3. Algebras and terms -- 1.4. Many-sorted algebras -- 1.5. Context-free grammars seen as algebras -- 1.6. Equations and substitutions -- 1.7. Algebraic structures and logical formulae -- 2. Foundations of Logic Programming -- 2.1. Syntactic notions -- 2.2. Semantics of definite programs -- 2.3. Summary and bibliographical comments -- 3. Grammatical Extensions of Logic Programs -- 3.1. W-grammars -- 3.2. Definite clause grammars -- 4. Attribute Grammars -- 4.1. Informal introduction -- 4.2. Definitions of attribute grammars -- 4.3. Attribute dependency schemes -- 4.4. Proof methods for partial correctness -- 4.5. Proof methods for decorated parse trees -- 4.6. Proof methods for completeness -- 4.7. Some remarks -- 5. Attribute Grammars and Logic Programming -- 5.1. From definite programs to attribute grammars with the declarative semantics -- 5.2. Attribute dependency schemes for definite programs -- 5.3. Modelling the operational semantics by attribute grammars -- 5.4. From functional attribute grammars to definite programs -- 6. Proof Methods for Definite Programs -- 6.2. Verification of programs with respect to the declarative semantics -- 6.3. Verification of programs with respect to the unification semantics -- 6.4. Verification of run-time properties -- 7. Proof Methods for Partial Correctness of Definite Programs -- 7.2. The inductive proof method -- 7.3. Proof method with annotation -- 7.4. An extended example -- 8. The Occur-check Problem -- 8.1. The problem -- 8.2. The occur-check problem for a system of equations -- 8.3. The occur-check problem for a program -- 8.4. Undecidability of the occur-check problem for a program -- 8.5. A sufficient NSTO condition for a system of equations -- 8.6. Sufficient NSTO conditions for a program -- 8.7. Discussion.