|Listed in category:
Have one to sell?

Clause and Effect: Prolog Programming for the Working Programmer by William F. C

Condition:
Brand New
3 available
Price:
US $97.70
ApproximatelyRM 460.46
Postage:
Free Economy Shipping. See detailsfor shipping
Located in: Fairfield, Ohio, United States
Delivery:
Estimated between Tue, 9 Jul and Fri, 19 Jul to 43230
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return shipping. See details- for more information about returns
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)

Shop with confidence

eBay Premium Service
Trusted seller, fast shipping, and easy returns. 

Seller information

Registered as a Business Seller
Seller assumes all responsibility for this listing.
eBay item number:395346810524
Last updated on May 19, 2024 18:19:16 MYTView all revisionsView all revisions

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
ISBN-13
9783540629719
Book Title
Clause and Effect
ISBN
9783540629719
Subject Area
Computers
Publication Name
Clause and Effect : Prolog Programming for the Working Programmer
Publisher
Springer Berlin / Heidelberg
Item Length
9.3 in
Subject
Programming Languages / General, Programming / General, Software Development & Engineering / General, Compilers
Publication Year
1997
Type
Textbook
Format
Trade Paperback
Language
English
Item Height
0.2 in
Author
William F. Clocksin
Item Weight
18.7 Oz
Item Width
6.1 in
Number of Pages
IX, 143 Pages

About this product

Product Information

This book is for people who have done some programming, either in Prolog or in a language other than Prolog, and who can find their way around a reference manual. The emphasis of this book is on a simplified and disciplined methodology for discerning the mathematical structures related to a problem, and then turning these structures into Prolog programs. This book is therefore not concerned about the particular features of the language nor about Prolog programming skills or techniques in general. A relatively pure subset of Prolog is used, which includes the 'cut', but no input/output, no assert/retract, no syntactic extensions such as if- then-else and grammar rules, and hardly any built-in predicates apart from arithmetic operations. I trust that practitioners of Prolog program- ming who have a particular interest in the finer details of syntactic style and language features will understand my purposes in not discussing these matters. The presentation, which I believe is novel for a Prolog programming text, is in terms of an outline of basic concepts interleaved with worksheets. The idea is that worksheets are rather like musical exercises. Carefully graduated in scope, each worksheet introduces only a limited number of new ideas, and gives some guidance for practising them. The principles introduced in the worksheets are then applied to extended examples in the form of case studies.

Product Identifiers

Publisher
Springer Berlin / Heidelberg
ISBN-10
3540629718
ISBN-13
9783540629719
eBay Product ID (ePID)
743465

Product Key Features

Number of Pages
IX, 143 Pages
Language
English
Publication Name
Clause and Effect : Prolog Programming for the Working Programmer
Publication Year
1997
Subject
Programming Languages / General, Programming / General, Software Development & Engineering / General, Compilers
Type
Textbook
Subject Area
Computers
Author
William F. Clocksin
Format
Trade Paperback

Dimensions

Item Height
0.2 in
Item Weight
18.7 Oz
Item Length
9.3 in
Item Width
6.1 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
97-035795
Dewey Edition
21
Number of Volumes
1 Vol.
Illustrated
Yes
Dewey Decimal
005.13/3
Lc Classification Number
Qa76.6-76.66
Table of Content
1. Getting Started.- 1.1 Syntax.- 1.2 Programs.- 1.3 Unification.- 1.4 Execution Model.- 2. Data Structures.- 2.1 Square Bracket Notation.- 2.2 Arithmetic.- 3. Mapping.- Worksheet 10: Full Maps.- Worksheet 11: Multiple Choices.- Worksheet 12: Partial Maps.- Worksheet 13: Removing Duplicates.- Worksheet 14: Partial Maps with a Parameter.- Worksheet 15: Multiple Disjoint Partial Maps.- Worksheet 16: Multiple Disjoint Partial Maps.- Worksheet 17: Full Maps with State.- Worksheet 18: Sequential Maps with State.- Worksheet 19: Scattered Maps with State.- 4. Choice and Commitment.- 4.1 The 'Cut'.- 4.2 A Disjoint Partial Map with Cut.- 4.3 Taming Cut.- 4.4 Cut and Negation-as-Failure.- 4.5 Negation-as-Failure Can Be Misleading.- 5. Difference Structures.- Worksheet 25: Concatenating Lists.- Worksheet 26: Rotations of a List.- Worksheet 27: Linearising.- 5.1 Difference Lists.- 5.2 Solution to Max Tree.- 6. Case Study: Term Rewriting.- 6.1 Symbolic Differentiation.- 6.2 Matrix Products by Symbolic Algebra.- 6.3 The Simplifier.- 7. Case Study: Manipulation of Combinational Circuits.- 7.1 Representing Circuits.- 7.2 Simulation of Circuits.- 7.3 Sums and Products.- 7.4 Simplifying SOP Expressions.- 7.5 Alternative Representation.- 8. Case Study: Clocked Sequential Circuits.- 8.1 Divide-by-Two Pulse Divider.- 8.2 Sequential Parity Checker.- 8.3 Four-Stage Shift Register.- 8.4 Gray Code Counter.- 8.5 Specification of Cascaded Components.- 9. Case Study: A Compiler forThree Model Computers.- 9.1 The Register Machine.- 9.2 The Single-Accumulator Machine.- 9.3 The Stack Machine.- 9.4 Optimisation: Preprocessing the Syntax Tree.- 9.5 Peephole Optimisation.- 10. Case Study: The Fast Fourier Transform in Prolog.- 10.1 Introduction.- 10.2 Notation for Polynomials.- 10.3 The DFT.- 10.4Example: 8-point DFT.- 10.5 Naive Implementation of the DFT.- 10.6 From DFT to FFT.- 10.7 Merging Common Subexpressions.- 10.8 The Graph Generator.- 10.9 Example Run: 8-point FFT.- 10.10 Bibliographic Notes.- 11. Case Study: Higher-Order Functional Programming.- 11.1 Introduction.- 11.2 A Notation for Functions.- 11.3 The Evaluator.- 11.4 Using Higher-Order Functions.- 11.5 Discussion.- 11.6 Bibliographic Notes.
Copyright Date
1997

Item description from the seller

grandeagleretail

grandeagleretail

98.3% positive feedback
2.7M items sold
Usually responds within 24 hours

Detailed Seller Ratings

Average for the last 12 months

Accurate description
4.9
Reasonable shipping cost
5.0
Shipping speed
4.9
Communication
4.9

Seller feedback (1,025,618)

r***r (428)- Feedback left by buyer.
Past month
Verified purchase
Good deal...
a***a (100)- Feedback left by buyer.
Past month
Verified purchase
Highly satisfied. Thank you!
3***u (409)- Feedback left by buyer.
Past month
Verified purchase
My purchase arrived in perfect condition and carefully packed