Download A small matter of programming: perspectives on end-user by Bonnie A. Nardi PDF

By Bonnie A. Nardi

A Small topic of Programming asks why it's been so tough for finish clients to command programming energy and explores the issues of finish user-driven software improvement that needs to be solved to have the funds for finish clients larger computational power.Drawing on empirical examine on present finish person structures, A Small topic of Programming analyzes cognitive, social, and technical problems with finish consumer programming. particularly, it examines the significance of task-specific programming languages, visible program frameworks, and collaborative paintings practices for finish consumer computing, with the target of aiding designers and programmers comprehend and higher fulfill the desires of finish clients who wish the potential to create, customise, and expand their functions software.The rules within the publication are in accordance with the author's learn on winning finish consumer programming structures - spreadsheets and CAD structures - in addition to different empirical examine. Nardi concentrates on large matters in finish person programming, in particular finish clients' strengths and difficulties, introducing instruments and methods as they're concerning higher-level consumer issues.Bonnie A. Nardi is a Member of the Technical employees at Hewlett Packard Laboratories.

Show description

Read Online or Download A small matter of programming: perspectives on end-user computing PDF

Similar programming languages books

php/architect's Guide to Enterprise PHP Development

I purchased this ebook hoping to enhance my software program improvement ability set by means of including administration abilities to my repertoire yet regrettably discovered that the e-book went a lot additional than that. This ebook discusses on hand instruments, workflow situations, and basic wisdom approximately personal home page from a non technical viewpoint. I just a little wanted that the ebook spent extra time speaking approximately an iterative (read: Agile) improvement technique yet total a great learn from a well informed individual.

Introduction to Languages and the Theory of Computation

Advent to Languages and the speculation of Computation is helping scholars make the relationship among the perform of computing and an knowing of the profound principles that defines it. The book's association and the author's skill to give an explanation for advanced issues sincerely make this creation to the speculation of computation a great source for a large diversity of higher point scholars.

Extra resources for A small matter of programming: perspectives on end-user computing

Sample text

X, SLD-resolution can be applied to test P'. The above argument is correct, but an important point is missing, namely that and in the above method, answer substitutions are lost. It is possible to try to argue that the above method can be refined to take care of this problem. However, a refinement that works in the general case will have to mimic our method. This is because, in order to return the correct answer substitution, it is necessary to keep track carefully of all uses of negations of clauses from the query.

Who is innocent? The above puzzle can be formalized as follows: shot(X, X). inhouse(X), ingarden(X). +- ingarden( dale), ingarden(peter). inhouse(j essica). suspect( dale). suspect(peter ). suspect(j essica). suspect( dave). ingarden(X) +- shot( dave, X). shot(dave, X) +- ingarden(X), suspect(X). +- +- ? - -'shot(dave, X). The Hornlog system returns the expected substitutions, X and the indefinite answer X = dale V X = peter. = dave, X = jessica, A Prolog solution to the above example has a very different character that does not reflect the negative content of the information.

Since (B 2 ,Bs) E E and Bs is marked, mark B2i 5. since (B 1 , B 2 ) E E and B2 is marked, mark Bl i 6. 1. 56 5 SOUNDNESS AND COMPLETENESS RESULTS I This pebbling is thus of length 6. 4 Let Gp = (V,E,L) be a ground H-graph for a set P of ground Horn clauses. 1 from {T} in Gp. They also give an algorithm, the traverse procedure, which identifies pebblings in linear time and which is shown to be sound and complete, in the sense that if it finds a pebbling in G p, P is (model-theoretically) unsatisfiable, and if P is unsatisfiable, the algorithm will find a pebbling.

Download PDF sample

Rated 4.11 of 5 – based on 42 votes