Choose an application

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

Mathematical logic --- Recursion theory --- Logic, Symbolic and mathematical --- LOGIQUE MATHEMATIQUE --- METAMATHEMATIQUE --- THEORIE DE LA RECURSIVITE

Choose an application

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

International Federation for Information Processing The IFIP series publishes state-of-the-art results in the sciences and technologies of information and communication. The scope of the series includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction. Proceedings and post-proceedings of referred international conferences in computer science and interdisciplinary fields are featured. These results often precede journal publication and represent the most current research. The principal aim of the IFIP series is to encourage education and the dissemination and exchange of information about all aspects of computing. For more information about the 300 other books in the IFIP series, please visit www.springer.com. For more information about IFIP, please visit www.ifip.org.

Robots --- RDF (Document markup language) --- Queuing theory --- Recursion theory --- RDF (Langage de balisage) --- Files d'attente, Théorie des --- Théorie de la récursivité --- Programming --- Programmation --- Computer science -- Congresses. --- Computer science --- Engineering & Applied Sciences --- Computer Science --- Computer networks --- Artificial intelligence --- Computer science. --- Computers. --- Computer Science. --- Theory of Computation. --- Computer Science, general. --- Information theory. --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Machine theory --- Calculators --- Cyberspace

Choose an application

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

This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics.

Programming --- Mathematical logic --- PASCAL (Computer program language) --- Electronic digital computers --- Recursion theory --- PASCAL (Langage de programmation) --- Programmation des ordinateurs --- Théorie de la récursivité --- Pascal (Computer program language) --- Computer programming --- 681.3*D3 --- 681.3*F33 --- 681.3*F41 --- Programming languages --- Studies of program constructs: control primitives; functional constructs; program and recursion schemes; type structure (Logics and meanings of programs)-- See also {681.3*D32}; {681.3*D33} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Computer programming. --- Recursion theory. --- Pascal (programmeertaal) --- Recursieve technieken --- Pascal (programmeertaal). --- Recursieve technieken. --- Pascal (Computer program language). --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F33 Studies of program constructs: control primitives; functional constructs; program and recursion schemes; type structure (Logics and meanings of programs)-- See also {681.3*D32}; {681.3*D33} --- 681.3*D3 Programming languages --- Théorie de la récursivité --- Logic, Symbolic and mathematical --- Programming languages (Electronic computers) --- Computers --- Electronic computer programming --- Electronic data processing --- Programming (Electronic computers) --- Coding theory