+7(495) 980-12-10
  10:00-18:00 пн-сб
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
  Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Специальные предложения | Бестселлеры
 
 
Книги
Книги зарубежных издательств на иностранных языках

Книги российских издательств

Представительство в Казахстане
 
Вход в систему
 
Войти
Регистрация  Забыли?
 
Информация
Контакты/Адрес/Проезд
Корзина
Ваши заказы
Доставка и Оплата
Заказ по телефону/email
Помощь
Есть вопрос?
О компании
Политика конфиденциальности
LgBook.ru
FkBook.ru
 
Online Каталоги
Каталог учебной литературы
по английскому языку >>>

Каталог учебной литературы
по английскому языку >>>


Lambda-Calculus and Combinators, J. Roger Hindley
Lambda-Calculus and Combinators

Автор: J. Roger Hindley
Название:  Lambda-Calculus and Combinators   (Лямбда-исчисление и комбинаторы)
Издательство: Cambridge Academ
Классификация:
Основы математики
Химия
Математическая теория вычисления

ISBN: 0521898854
ISBN-13(EAN): 9780521898850
ISBN: 0-521-89885-4
ISBN-13(EAN): 978-0-521-89885-0
Обложка/Формат: Hardback
Страницы: 360
Вес: 0.668 кг.
Дата издания: 24.07.2008
Язык: ENG
Издание: 2 rev ed
Иллюстрации: 10 b/w illus. 1 table 55 exercises
Размер: 22.86 x 15.24 x 2.29 cm
Читательская аудитория: Undergraduate
Подзаголовок: An introduction
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Англии
Описание: Combinatory logic and lambda-calculus, originally devised in the 1920s, have since developed into linguistic tools, especially useful in programming languages. The authors previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this version is thoroughly revised and offers an account of the subject with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.
Описание: Keeping technical requirements to a minimum, this long-awaited new edition gives a modern account of combinatory logic and lambda-calculus models.
Дополнительное описание:

Добавить в Мои желания

 Варианты приобретения 
  Наличие на складе Кол-во / Цена р.
1 Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 981шт.  Склад Америка: 51шт.  
При оформлении заказа до: 8 фев 2018
Ориентировочная дата поставки: Начало Марта
5588.00
Добавить в корзину


Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.

Автор: Korte, Bernhard, Vygen, Jens
Название: Combinatorial Optimization (algorithms and Combinatorics 21) 5th ed.
ISBN: 3642244874 ISBN-13(EAN): 9783642244872
Издательство: Springer
Рейтинг:
Цена: 5001 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.

в Мои желания
Lambda Calculus with Types

Автор: Barendregt
Название: Lambda Calculus with Types
ISBN: 0521766141 ISBN-13(EAN): 9780521766142
Издательство: Cambridge Academ
Рейтинг:
Цена: 5434 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and has been treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), which are used to design and verify IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. Unexpected mathematical beauty is revealed in these three formalisms of terms and types. Numerous exercises are provided to deepen the reader's understanding and increase their confidence using types.

в Мои желания
Classic Papers in Combinatorics

Автор: Ira Gessel; G.-C. Rota (Eds.)
Название: Classic Papers in Combinatorics
ISBN: 0817648410 ISBN-13(EAN): 9780817648411
Издательство: Springer
Рейтинг:
Цена: 6159 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Surveys the development of combinatorics since 1930 by presenting in chronological order the fundamental results of the subject.

в Мои желания
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings

Автор: Van Hentenryck Pascal, Wolsey Laurence
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings
ISBN: 354072396X ISBN-13(EAN): 9783540723967
Издательство: Springer
Рейтинг:
Цена: 6698 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007.The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.

в Мои желания
Global Methods for Combinatorial Isoperimetric Problems

Автор: L. H. Harper
Название: Global Methods for Combinatorial Isoperimetric Problems
ISBN: 0521832683 ISBN-13(EAN): 9780521832687
Издательство: Cambridge Academ
Рейтинг:
Цена: 6311 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Certain constrained combinatorial optimisation problems have a natural analogue in the continuous setting of the classical isoperimetric problem. The study of so called combinatorial isoperimetric problems exploits similarities between these two, seemingly disparate, settings. This text focuses on global methods. This means that morphisms, typically arising from symmetry or direct product decomposition, are employed to transform new problems into more restricted and easily solvable settings whilst preserving essential structure. This book is based on Professor Harper’s many years experience in teaching this subject and is ideal for graduate students entering the field. The author has increased the utility of the text for teaching by including worked examples, exercises and material about applications to computer science. Applied systematically, the global point of view can lead to surprising insights and results and established researchers will find this to be a valuable reference work on an innovative method for problem solving.

в Мои желания
Combinatorial Designs / Construction and Analysis

Автор: Stinson Douglas R.
Название: Combinatorial Designs / Construction and Analysis
ISBN: 0387954872 ISBN-13(EAN): 9780387954875
Издательство: Springer
Цена: 7080 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatiorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced.A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applied math, combinatorics, and applied statistics will find the book an essential resource.

в Мои желания
Combinatorial Pattern Matching / 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings

Автор: Apostolico Alberto, Takeda Masayuki
Название: Combinatorial Pattern Matching / 13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings
ISBN: 3540438629 ISBN-13(EAN): 9783540438625
Издательство: Springer
Рейтинг:
Цена: 5774 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching, CPM 2002, held in Fukuoka, Japan, in July 2002.The 21 revised full papers presented together with two invited contributions were carefully reviewed and selected from 37 submissions. The papers are devoted to current theoretical and computational aspects of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays. Among the application fields are the World Wide Web, computational biology, computer vision, multimedia, information retrieval, data compression, and pattern recognition.

в Мои желания
New Perspectives in Algebraic Combinatorics

Автор: Billera
Название: New Perspectives in Algebraic Combinatorics
ISBN: 0521179793 ISBN-13(EAN): 9780521179799
Издательство: Cambridge Academ
Рейтинг:
Цена: 2804 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: During 1996–7 MSRI held a full academic year program on Combinatorics, with special emphasis on the connections with other branches of mathematics, such as algebraic geometry, topology, commutative algebra, representation theory, and convex geometry. The rich combinatorial problems arising from the study of various algebraic structures are the subject of this book, which represents work done or presented at seminars during the program. It contains contributions on matroid bundles, combinatorial representation theory, lattice points in polyhedra, bilinear forms, combinatorial differential topology and geometry, Macdonald polynomials and geometry, enumeration of matchings, the generalized Baues problem, and Littlewood–Richardson semigroups. These expository articles, written by some of the most respected researchers in the field, will continue to be of use to graduate students and researchers in combinatorics as well as algebra, geometry, and topology.

в Мои желания
Quantitative Graph Theory

Автор: Dehmer Matthias, Emmert-Streib Frank
Название: Quantitative Graph Theory
ISBN: 1466584513 ISBN-13(EAN): 9781466584518
Издательство: Taylor&Francis
Рейтинг:
Цена: 7568 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This is the first book devoted exclusively to quantitative graph theory. It presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs. Through its broad coverage, this text fills a gap in the contemporary literature of discrete and applied mathematics, computer science, systems biology, and related disciplines.

в Мои желания
Evolutionary Computation in Combinatorial Optimization

Автор: Hao
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3642291236 ISBN-13(EAN): 9783642291234
Издательство: Springer
Рейтинг:
Цена: 3849 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 12th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2012, held in M?laga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. . The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms, and ant colony optimization.

в Мои желания
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings

Автор: Beck J. Christopher, Smith Barbara
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings
ISBN: 3540343067 ISBN-13(EAN): 9783540343066
Издательство: Springer
Рейтинг:
Цена: 5389 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2006, held in Cork, Ireland in May/June 2006.The 20 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 67 submissions. The papers address methodological and foundational issues from AI, OR, and algorithmics and present applications to the solution of combinatorial optimization problems in various fields via constraint programming.

в Мои желания
Computing and Combinatorics / 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings

Автор: Chen Danny Z., Lee D.T.
Название: Computing and Combinatorics / 12th Annual International Conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006, Proceedings
ISBN: 3540369252 ISBN-13(EAN): 9783540369257
Издательство: Springer
Рейтинг:
Цена: 7699 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The refereed proceedings of the 12th Annual International Computing and Combinatorics Conference, COCOON 2006, held in Taipei, Taiwan, in August 2006.The 52 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 137 submissions. The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, computational biology, graph algorithms and applications, on-line algorithms, algorithms for security and systems, discrete geometry and graph theory, approximation algorithms, and experimental algorithms.

в Мои желания

ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
Мобильная версия : : : : : : : : : : : : : : : : : : : :