Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

While compilers for high-level programming languages are large complex software systems, they have particular characteristics that differentiate them from other software systems. Their functionality is almost completely well-defined - ideally there exist complete precise descriptions of the source and target languages. Additional descriptions of the interfaces to the operating system, programming system and programming environment, and to other compilers and libraries are often available.   The book deals with the optimization phase of compilers. In this phase, programs are transformed in order to increase their efficiency. To preserve the semantics of the programs in these transformations, the compiler has to meet the associated applicability conditions. These are checked using static analysis of the programs. In this book the authors systematically describe the analysis and transformation of imperative and functional programs. In addition to a detailed description of important efficiency-improving transformations, the book offers a concise introduction to the necessary concepts and methods, namely to operational semantics, lattices, and fixed-point algorithms.   This book is intended for students of computer science. The book is supported throughout with examples, exercises and program fragments.

Computer science --- Programming --- programmeren (informatica) --- programmeertalen --- Compilers (Computer programs) --- Compilateurs (Logiciels) --- EPUB-LIV-FT LIVINFOR SPRINGER-B

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume contains the proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA2005),whichwasheldonApril19- 21, 2005, at the Nara-Ken New Public Hall in the center of the Nara National Park in Nara, Japan. RTA is the major forum for the presentation of research on all aspects of rewriting.PreviousRTAconferenceswereheldinDijon(1985),Bordeaux(1987), Chapel Hill (1989), Como (1991), Montreal (1993), Kaiserslautern (1995), Rutgers (1996), Sitges (1997), Tsukuba (1998), Trento (1999), Norwich (2000), Utrecht (2001), Copenhagen (2002), Valencia (2003), and Aachen (2004). This year, there were 79 submissions from 20 countries, of which 31 papers were accepted for publication (29 regular papers and 2 system descriptions). The submissions came from France (10 accepted papers of the 23.1 submitted papers), USA (5.6 of 11.7), Japan (4 of 9), Spain (2.7 of 6.5), UK (2.7 of 4.7), The Netherlands (1.7 of 3.8), Germany (1.3 of 2.3), Austria (1 of 1), Poland (1 of 1), Israel (0.5 of 0.8), Denmark (0.5 of 0.5), China (0 of 4), Korea (0 of 4), Taiwan (0 of 1.3), Australia (0 of 1), Brazil (0 of 1), Russia (0 of 1), Switzerland (0 of 1), Sweden (0 of 1), and Italy (0 of 0.3). Each submission was assigned to at least three Program Committee m- bers, who carefully reviewed the papers, with the help of 111 external referees.

Machine theory. --- Computer science. --- Compilers (Computer programs). --- Artificial intelligence. --- Computer science—Mathematics. --- Formal Languages and Automata Theory. --- Computer Science Logic and Foundations of Programming. --- Compilers and Interpreters. --- Artificial Intelligence. --- Symbolic and Algebraic Manipulation. --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Compiling programs (Computer programs) --- Computer programs --- Programming software --- Systems software --- Informatics --- Science --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

An Introduction to Computability Theory provides an introduction to the essential concepts in computability, using several models of computation, from Turing machines to the modern computation models inspired by quantum physics. It is addressed to advanced undergraduate students, as a complement to programming courses, or to postgraduate students interested in foundations of computation and the theory of computability. There are two parts in the book. The first highlights the traditional models of computation used in the first studies on computability: - Automata and Turing Machines; - Recursive functions and the Lambda-Calculus; - Logic-based computation models. The second part covers object-oriented and interaction-based models, and includes a chapter on concurrency and a chapter on emergent models of computation inspired by quantum mechanics and systems biology. At the end of each chapter there is a list of exercises, solutions to selected exercises are provided in the final chapter of the book. The book gives an in-depth analysis of the basic concepts underlying each model of computation. It privileges the understanding of the basic techniques and their relationships over simply describing their properties.

Computable functions. --- Electronic books. -- local. --- Turing machines. --- Computable functions --- Turing machines --- Algebra --- Mathematical Theory --- Computer Science --- Engineering & Applied Sciences --- Mathematics --- Physical Sciences & Mathematics --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- Computer science. --- Software engineering. --- Programming languages (Electronic computers). --- Computers. --- Computer Science. --- Software Engineering/Programming and Operating Systems. --- Programming Languages, Compilers, Interpreters. --- Theory of Computation. --- Computation by Abstract Devices. --- Machine theory --- Constructive mathematics --- Decidability (Mathematical logic) --- Information theory. --- Communication theory --- Communication --- Cybernetics --- Informatics --- Science --- Computer software engineering --- Engineering --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Calculators --- Cyberspace --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Compilers (Computer programs). --- Software Engineering. --- Compilers and Interpreters. --- Compiling programs (Computer programs) --- Computer programs --- Programming software --- Systems software

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Questo testo è espressamente concepito per i corsi brevi del nuovo ordinamento delle Facoltà di Ingegneria e di Scienze. Esso affronta tutti gli argomenti tipici della Matematica Numerica, spaziando dal problema di approssimare una funzione, al calcolo dei suoi zeri, delle sue derivate e del suo integrale definito fino alla risoluzione approssimata di equazioni differenziali ordinarie e di problemi ai limiti. Due capitoli sono inoltre dedicati alla risoluzione di sistemi lineari ed al calcolo degli autovalori di una matrice, mentre un capitolo iniziale conduce lo studente ad un rapido ripasso degli argomenti dell'Analisi Matematica di uso frequente nel volume e ad una introduzione al linguaggio Matlab. I vari argomenti sono volutamente affrontati a livello elementare. Al fine di rendere maggiormente incisiva la presentazione è stato fatto uso del programma Matlab, tramite il quale si mostra come rendere esecutivi tutti gli algoritmi che via via si introdurranno, oltre a fornire un riscontro quantitativo immediato alla teoria. Vengono inoltre proposti numerosi esercizi, tutti risolti per esteso, ed esempi, anche con riferimento a specifiche applicazioni. I programmi Matlab presenti nel testo si possono scaricare dalla pagina web mox.polimi.it/qs. In questa quarta edizione il linguaggio Octave (di distribuzione gratuita) si affianca a MATLAB. Dopo una introduzione in cui si evidenziano le numerosissime analogie e i punti di divergenza più significativi fra i due linguaggi, tutti i programmi presentati sono stati resi compatibili anche con Octave. Inoltre sono state effettuate numerose integrazioni al capitolo relativo all'approssimazione con differenze finite ed elementi finiti di problemi ai limiti, sia stazionari che evolutivi.

Algebra --- Mathematical analysis --- Algèbre --- Analyse mathématique --- Computer programs --- Logiciels --- MATLAB --- Computer science - Mathematics. --- Engineering mathematics. --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Applied Mathematics --- Mathematical Theory --- Computer programs. --- MATLAB. --- 517.1 Mathematical analysis --- MATLAB (Computer program) --- Matrix laboratory --- Mathematics. --- Mathematical analysis. --- Analysis (Mathematics). --- Applied mathematics. --- Computer mathematics. --- Mathematical models. --- Mathematics, general. --- Analysis. --- Applications of Mathematics. --- Computational Mathematics and Numerical Analysis. --- Mathematical Modeling and Industrial Mathematics. --- Models, Mathematical --- Simulation methods --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Engineering --- Engineering analysis --- Math --- Science --- Global analysis (Mathematics). --- Computer science --- Analysis, Global (Mathematics) --- Differential topology --- Functions of complex variables --- Geometry, Algebraic

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Machine Translation is the author's comprehensive view of machine translation (MT) from the perspective of a participant in its history and development. The text considers MT as a fundamental part of Artificial Intelligence and the ultimate test-bed for all computational linguistics, covering historical and contemporary systems in Europe, the US and Japan. The author describes and contrasts a range of approaches to MT's challenges and problems, and shows the evolution of conflicting approaches to MT towards some kind of skeptical consensus on future progress. The volume includes historic papers, updated with commentaries detailing their significance both at the time of their writing and now. The book concludes with a discussion of the most recent developments in the field and prospects for the future, which have been much changed by the arrival of the World Wide Web. Anyone interested in the progress of science and technology, particularly computer scientists and students, will find this a fascinating exploration of MT technology. Yorick Wilks is a Professor of Computer Science at the University of Sheffield, where he directs the Institute for Language, Speech and Hearing. He received his M.A. and Ph.D. (1968) from Pembroke College, Cambridge. He has also taught or researched at Stanford, Edinburgh, Geneva, Essex and New Mexico State Universities. His interests are artificial intelligence and the computer processing of language, knowledge and belief. He is a Fellow of the European and American Societies for Artificial Intelligence, a Fellow of the EPSRC College of Computing and a member of the UK Computing Research Council. Wilks was awarded the Antonio Zampolli prize by the European Language Resources Association in 2008. This prize is given to individuals whose work lies within the areas of Language Resources and Language Technology Evaluation with acknowledged contributions to their advancements. He was also the recipient of an ACL Life Achievement Award at the 46th Annual Meeting of the Association for Computational Linguistics in 2008.

Linguistics --- informatietechnologie --- Translation science --- Computer. Automation --- robots --- computergeschiedenis --- Information systems --- Operational research. Game theory --- IR (information retrieval) --- Artificial intelligence. Robotics. Simulation. Graphics --- vertalen --- linguïstiek --- stochastische analyse --- 800 --- 681.3* / / / / / / / / / / / / / / / / / / / / / / / / / / / / --- 800 Taalwetenschap. Taalkunde. Linguistiek --- Taalwetenschap. Taalkunde. Linguistiek --- Computerwetenschap --- Computer Science --- Information storage and retrieval systems --- Artificial intelligence --- Translators (Computer programs)