Search results for "program language mastery"
Items we need to order for you
How to Write Good Programs
Learning to program isn't just learning the details of a programming language: to become a good programmer you have to become expert at debugging, testing, writing clear code and generally unsticking yourself when you get stuck, while to do well in a programming course you have to learn to score highly in coursework and exams. Featuring tips, stories and explanations of key terms, this book teaches these skills explicitly. Examples in Python, Java and Haskell are included, helping you to gain transferable programming skills whichever language you are learning. Intended for students in Higher or Further Education studying early programming courses, it will help you succeed in, and get the most out of, your course, and support you in developing the software engineering habits that lead to good programs.
R 796.00
R 165.00
Automata, Languages and Programming
The Second Colloquium on Automata, Languages and Programming is the successor of a similar Colloquium organized by IRIA in Paris, July 3-7, 1972. The present Colloquium which takes place at the Unl-- versity of Saarbrucken from July 29th to August 2nd, 1974, is spon- sored by the Gesellschaft fur. Informatik and organized in cooperation wlth the Special Interest Group on Automata and Computability Theory (SIGACT) and with the European Association for Theoretical Computer Science (EATCS). As its predecessor the present Colloquium is devoted to the theo- retical bases of computer science. This volume contains the text of the different lectures of the Colloquium whlch have been selected by the Program Committee out of about 130 submitted papers. About one third of the papers of this volume is concerned with formal language theory, one other third with the theory of computation and the rest with complexity theory, automata theory, programming languages, etc.
R 1,743.39
R 709.00
R 611.00
R 165.00
R 781.00
Programmiersprachen
Der vorliegende Band enthalt die vortrage, die anlaBlich der 4. Fach- tagung Uber Programmiersprachen der Gesellschaft fUr Informatik gehal- ten wurden. Die drei vorangegangenen Fachtagungen Uber dieses Gebiet fanden in MUnchen (1971), SaarbrUcken (1972) und Kiel (1974) statt. Die Aufforderung zur Vortragsanmeldung enthielt die folgenden Fach- gebiete: Compiler und Interpreter Sprachen fUr Systemprogrammierung Dialogsprachen Programmiersprachen fUr besondere Anwendungen ProzeBrechnersprachen Erweiterbare Sprachen Nichtprozedurale Sprachen Programmiermethodik Semantik und Verifikation. Sie fand ein erstaunlich starkes Echo. Der ProgrammausschuB bestand aus den Mitgliedern des Fachausschusses 2 der GI: Prof. Dr. K. Alber (Braunschweig) W. Frielinghaus (Konstanz) Prof. Dr. H. Langmaack (Kiel) Prof. Dr. M. Paul (MUnchen) Prof. Dr. B. Schlender (Kiel) Prof. Dr. G. SeegmUller (Munchen). Er war bemuht, diejenigen Vortrage auszuwahlen, die am ehesten den gegenwartigen Stand der Forschung und Entwicklung wiedergeben.Die bereits im Tagungsband einer fruheren GI-Jahrestagung beklagten Ver- standigungsschwierigkeiten zwischen Forschern und Anwendern sin- wie das Verfahren der Vortragsauswahl zeigte - noch lange nicht uber- wunden. 1m Vergleich zu den frtiheren Tagungsbanden stieg jedoch die Anzahl der Vortrage, die den Anwendungen zuzurechnen sind. Dennoch bleibt fur weitere Fachtagungen in dieser Richtung noch viel zu tun. Den Vortragenden sei an dieser Stelle fur ihre Beitrage gedankt. Der Erfolg einer Tagung hangt in erster Linie von ihnen abo Daneben gilt unser Dank den Sitzungsleitern und den Mitgliedern des Programmkomi- tees, sowie den Mitarbeitern des Lehrstuhls fur Informatik II (Pro- IV gramrnier- und Dialogsprachen, sowie ihre Compiler) der Friedrich-Ale- xander-Universitat Erlangen-Nlirnberg, die alle bei der Organisation der Tagung geholfen :1aben.
R 2,054.98
R 393.00
R 635.00
R 639.00
R 857.00
R 838.00
R 712.00
R 670.00
Language and the Rise of the Algorithm
A wide-ranging history of the algorithm.Bringing together the histories of mathematics, computer science, and linguistic thought, Language and the Rise of the Algorithm reveals how recent developments in artificial intelligence are reopening an issue that troubled mathematicians well before the computer age: How do you draw the line between computational rules and the complexities of making systems comprehensible to people? By attending to this question, we come to see that the modern idea of the algorithm is implicated in a long history of attempts to maintain a disciplinary boundary separating technical knowledge from the languages people speak day to day. Here, Jeffrey M. Binder offers a compelling tour of four visions of universal computation that addressed this issue in very different ways: G. W. Leibniz’s calculus ratiocinator; a universal algebra scheme Nicolas de Condorcet designed during the French Revolution; George Boole’s nineteenth-century logic system; and the early programming language ALGOL, short for algorithmic language. These episodes show that symbolic computation has repeatedly become entangled in debates about the nature of communication. Machine learning, in its increasing dependence on words, erodes the line between technical and everyday language, revealing the urgent stakes underlying this boundary. The idea of the algorithm is a levee holding back the social complexity of language, and it is about to break. This book is about the flood that inspired its construction.
R 1,161.00
R 809.00
R 634.00
R 708.00
R 165.00
R 788.00
R 610.00
R 1,221.00
R 763.00
R 611.00
R 1,780.00
R 1,221.00
R 165.00
R 2,488.00
R 592.00
R 733.00
