Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7(495) 980-12-10
  пн-пт: 10-20 сб-вс: 11-18
  shop@logobook.ru
   
    Поиск книг                    Поиск по списку ISBN Расширенный поиск    
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Cертификаты | Хиты | |
 

Lambda-Calculus and Combinators, J. Roger Hindley



Варианты приобретения
Цена: 8339р.
Кол-во:
Наличие: Поставка под заказ.  Есть в наличии на складе поставщика.
Склад Англия: 182 шт.  Склад Америка: 51 шт.  
При оформлении заказа до: 30 июл 2021
Ориентировочная дата поставки: Середина- конец Августа

Добавить в корзину
в Мои желания

Автор: J. Roger Hindley
Название:  Lambda-Calculus and Combinators   (Лямбда-исчисление и комбинаторы)
Издательство: Cambridge Academ
Классификация:
ISBN: 0521898854
ISBN-13(EAN): 9780521898850
Обложка/Формат: Hardback
Страницы: 360
Вес: 0.668 кг.
Дата издания: 24.07.2008
Язык: English
Издание: 2 rev ed
Иллюстрации: 10 b/w illus. 1 table 55 exercises
Размер: 237 x 159 x 24
Читательская аудитория: 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.



Combinatorial Optimization / Polyhedra and Efficiency

Автор: Schrijver Alexander
Название: Combinatorial Optimization / Polyhedra and Efficiency
ISBN: 3540443894 ISBN-13(EAN): 9783540443896
Издательство: Springer
Рейтинг:
Цена: 12748 р.
Наличие на складе: Нет в наличии.

Описание: This book offers an in-depth overview of polyhedral methods and efficient algorithms in combinatorial optimization.These methods form a broad, coherent and powerful kernel in combinatorial optimization, with strong links to discrete mathematics, mathematical programming and computer science. In eight parts, various areas are treated, each starting with an elementary introduction to the area, with short, elegant proofs of the principal results, and each evolving to the more advanced methods and results, with full proofs of some of the deepest theorems in the area. Over 4000 references to further research are given, and historical surveys on the basic subjects are presented.

The Parametric Lambda Calculus / A Metamodel for Computation

Автор: Ronchi Della Rocca Simona, Paolini Luca
Название: The Parametric Lambda Calculus / A Metamodel for Computation
ISBN: 3540200320 ISBN-13(EAN): 9783540200321
Издательство: Springer
Рейтинг:
Цена: 8355 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: The parametric lambda calculus is a metamodel for reasoning about various kinds of computations. Its syntactic definition is based on the notion of "sets of input values", and different lambda calculi can be obtained from it by instantiating such sets in suitable ways. The parametric lambda calculus is used as a tool for presenting in a uniform way basic notions of programming languages, and for studying with a uniform approach some lambda calculi modeling different kinds of computations, such as call-by-name, both in its lazy and non-lazy versions, and call-by-value. The parametric presentation allows us both to prove in one step all the fundamental properties of different calculi, and to compare them with each other. The book includes some classical results in the field of lambda calculi, but completely rephrased using the parametric approach, together with some new results. The lambda calculi are presented from a computer science viewpoint, with particular emphasis on their semantics, both operational and denotational.This book is dedicated to researchers, and can be used as a textbook for masters or Ph.D. courses on the foundations of computer science.

Classic Papers in Combinatorics

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

Описание: 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
Рейтинг:
Цена: 9090 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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
Рейтинг:
Цена: 8858 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

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
Рейтинг:
Цена: 10449 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: 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.

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005

Автор: BartГЎk Roman, Milano Michela
Название: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005
ISBN: 3540261524 ISBN-13(EAN): 9783540261520
Издательство: Springer
Рейтинг:
Цена: 9926 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the proceedings of the Second International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2005, held in Prague, Czech Republic, in May/June 2005. This title presents methodological and foundational issues from AI , OR, and algorithmics.

New Perspectives in Algebraic Combinatorics

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

Описание: 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
Рейтинг:
Цена: 11549 р.
Наличие на складе: Поставка под заказ.

Описание: The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications 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 such as: Comparative approaches (graph similarity or distance) Graph measures to characterize graphs quantitatively Applications of graph measures in social network analysis and other disciplines Metrical properties of graphs and measures Mathematical properties of quantitative methods or measures in graph theory Network complexity measures and other topological indices Quantitative approaches to graphs using machine learning (e.g., clustering) Graph measures and statistics Information-theoretic methods to analyze graphs quantitatively (e.g., entropy) Through its broad coverage, Quantitative Graph Theory: Mathematical Foundations and Applications fills a gap in the contemporary literature of discrete and applied mathematics, computer science, systems biology, and related disciplines. It is intended for researchers as well as graduate and advanced undergraduate students in the fields of mathematics, computer science, mathematical chemistry, cheminformatics, physics, bioinformatics, and systems biology.

Evolutionary Computation in Combinatorial Optimization

Автор: Peter I. Cowling; Peter Merz
Название: Evolutionary Computation in Combinatorial Optimization
ISBN: 3642121381 ISBN-13(EAN): 9783642121388
Издательство: Springer
Рейтинг:
Цена: 7836 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constitutes the refereed proceedings of the 10th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2010, held in Instanbul, Turkey, in April 2010. This book discusses developments and applications in metaheuristics.

Combinatorial Image Analysis

Автор: Aggarwal
Название: Combinatorial Image Analysis
ISBN: 3642210724 ISBN-13(EAN): 9783642210723
Издательство: Springer
Рейтинг:
Цена: 9404 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This volume constitutes the refereed proceedings of the 14th International Workshop on Combinatorial Image Analysis, IWCIA 2011, held in Madrid, Spain, in May 2011. The 25 revised full papers and 13 poster papers presented together with 4 invited contributions were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections such as combinatorial problems in the discrete plane and space related to image analysis; lattice polygons and polytopes; discrete/combinatorial geometry and topology and their use in image analysis; digital geometry of curves and surfaces; tilings and patterns; combinatorial pattern matching; image representation, segmentation, grouping, and reconstruction; methods for image compression; discrete tomography; applications of integer programming, linear programming, and computational geometry to problems of image analysis; parallel architectures and algorithms for image analysis; fuzzy and stochastic image analysis; grammars and models for image or scene analysis and recognition, cellular automata; mathematical morphology and its applications to image analysis; applications in medical imaging, biometrics, and others.

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
Рейтинг:
Цена: 6787 р.
Наличие на складе: Невозможна поставка.

Описание: 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.


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