Foundations of Programming Languages
Foundations of Programming Languages

Author: Kent D. Lee

Publisher: Springer

Published: 2015-01-19

Total Pages: 365

ISBN-13: 3319133144

DOWNLOAD EBOOK

This clearly written textbook introduces the reader to the three styles of programming, examining object-oriented/imperative, functional, and logic programming. The focus of the text moves from highly prescriptive languages to very descriptive languages, demonstrating the many and varied ways in which we can think about programming. Designed for interactive learning both inside and outside of the classroom, each programming paradigm is highlighted through the implementation of a non-trivial programming language, demonstrating when each language may be appropriate for a given problem. Features: includes review questions and solved practice exercises, with supplementary code and support files available from an associated website; provides the foundations for understanding how the syntax of a language is formally defined by a grammar; examines assembly language programming using CoCo; introduces C++, Standard ML, and Prolog; describes the development of a type inference system for the language Small.

Foundations of Probabilistic Programming
Foundations of Probabilistic Programming

Author: Gilles Barthe

Publisher: Cambridge University Press

Published: 2020-12-03

Total Pages: 583

ISBN-13: 110848851X

DOWNLOAD EBOOK

This book provides an overview of the theoretical underpinnings of modern probabilistic programming and presents applications in e.g., machine learning, security, and approximate computing. Comprehensive survey chapters make the material accessible to graduate students and non-experts. This title is also available as Open Access on Cambridge Core.

An Introduction to Functional Programming Through Lambda Calculus
An Introduction to Functional Programming Through Lambda Calculus

Author: Greg Michaelson

Publisher: Courier Corporation

Published: 2013-04-10

Total Pages: 338

ISBN-13: 0486280292

DOWNLOAD EBOOK

Well-respected text for computer science students provides an accessible introduction to functional programming. Cogent examples illuminate the central ideas, and numerous exercises offer reinforcement. Includes solutions. 1989 edition.

Foundations of Logic Programming
Foundations of Logic Programming

Author: J. W. Lloyd

Publisher: Springer Science & Business Media

Published: 2012-12-06

Total Pages: 135

ISBN-13: 3642968260

DOWNLOAD EBOOK

This book gives an account oC the mathematical Coundations oC logic programming. I have attempted to make the book selC-contained by including prooCs of almost all the results needed. The only prerequisites are some Camiliarity with a logic programming language, such as PROLOG, and a certain mathematical maturity. For example, the reader should be Camiliar with induction arguments and be comCortable manipulating logical expressions. Also the last chapter assumes some acquaintance with the elementary aspects of metric spaces, especially properties oC continuous mappings and compact spaces. Chapter 1 presents the declarative aspects of logic programming. This chapter contains the basic material Crom first order logic and fixpoint theory which will be required. The main concepts discussed here are those oC a logic program, model, correct answer substitution and fixpoint. Also the unification algorithm is discussed in some detail. Chapter 2 is concerned with the procedural semantics oC logic programs. The declarative concepts are implemented by means oC a specialized Corm oC resolution, called SLD-resolution. The main results of this chapter concern the soundness and completeness oC SLD-resolution and the independence oC the computation rule. We also discuss the implications of omitting the occur check from PROLOG implementations. Chapter 3 discusses negation. Current PROLOG systems implement a form of negation by means of the negation as failure rule. The main results of this chapter are the soundness and completeness oC the negation as failure rule.

Programming Language Foundations
Programming Language Foundations

Author: Aaron Stump

Publisher: John Wiley & Sons

Published: 2013-09-23

Total Pages: 144

ISBN-13: 1118007476

DOWNLOAD EBOOK

Programming Language Foundations is a concise text that covers a wide range of topics in the mathematical semantics of programming languages, for readers without prior advanced background in programming languages theory. The goal of the book is to provide rigorous but accessible coverage of essential topics in the theory of programming languages. Stump’s Programming Language Foundations is intended primarily for a graduate-level course in programming languages theory which is standard in graduate-level CS curricula. It may also be used in undergraduate programming theory courses but ONLY where students have a strong mathematical preparation.

Purely Functional Data Structures
Purely Functional Data Structures

Author: Chris Okasaki

Publisher: Cambridge University Press

Published: 1999-06-13

Total Pages: 236

ISBN-13: 9780521663502

DOWNLOAD EBOOK

This book describes data structures and data structure design techniques for functional languages.

Programming with Higher-Order Logic
Programming with Higher-Order Logic

Author: Dale Miller

Publisher: Cambridge University Press

Published: 2012-06-11

Total Pages: 321

ISBN-13: 1139510428

DOWNLOAD EBOOK

Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion that must be treated carefully at a computational level. This book aims to show that a programming language based on a simply typed version of higher-order logic provides an elegant, declarative means for providing such a treatment. Three broad topics are covered in pursuit of this goal. First, a proof-theoretic framework that supports a general view of logic programming is identified. Second, an actual language called λProlog is developed by applying this view to higher-order logic. Finally, a methodology for programming with specifications is exposed by showing how several computations over formal objects such as logical formulas, functional programs, and λ-terms and π-calculus expressions can be encoded in λProlog.

The Haskell Road to Logic, Maths and Programming
The Haskell Road to Logic, Maths and Programming

Author: Kees Doets

Publisher: College Publications

Published: 2004

Total Pages: 448

ISBN-13:

DOWNLOAD EBOOK

Long ago, when Alexander the Great asked the mathematician Menaechmus for a crash course in geometry, he got the famous reply ``There is no royal road to mathematics.'' Where there was no shortcut for Alexander, there is no shortcut for us. Still, the fact that we have access to computers and mature programming languages means that there are avenues for us that were denied to the kings and emperors of yore. The purpose of this book is to teach logic and mathematical reasoning in practice, and to connect logical reasoning with computer programming in Haskell. Haskell emerged in the 1990s as a standard for lazy functional programming, a programming style where arguments are evaluated only when the value is actually needed. Haskell is a marvelous demonstration tool for logic and maths because its functional character allows implementations to remain very close to the concepts that get implemented, while the laziness permits smooth handling of infinite data structures. This book does not assume the reader to have previous experience with either programming or construction of formal proofs, but acquaintance with mathematical notation, at the level of secondary school mathematics is presumed. Everything one needs to know about mathematical reasoning or programming is explained as we go along. After proper digestion of the material in this book, the reader will be able to write interesting programs, reason about their correctness, and document them in a clear fashion. The reader will also have learned how to set up mathematical proofs in a structured way, and how to read and digest mathematical proofs written by others. This is the updated, expanded, and corrected second edition of a much-acclaimed textbook. Praise for the first edition: 'Doets and van Eijck's ``The Haskell Road to Logic, Maths and Programming'' is an astonishingly extensive and accessible textbook on logic, maths, and Haskell.' Ralf Laemmel, Professor of Computer Science, University of Koblenz-Landau

Pearls of Functional Algorithm Design
Pearls of Functional Algorithm Design

Author: Richard Bird

Publisher: Cambridge University Press

Published: 2010-09-16

Total Pages:

ISBN-13: 1139490605

DOWNLOAD EBOOK

Richard Bird takes a radical approach to algorithm design, namely, design by calculation. These 30 short chapters each deal with a particular programming problem drawn from sources as diverse as games and puzzles, intriguing combinatorial tasks, and more familiar areas such as data compression and string matching. Each pearl starts with the statement of the problem expressed using the functional programming language Haskell, a powerful yet succinct language for capturing algorithmic ideas clearly and simply. The novel aspect of the book is that each solution is calculated from an initial formulation of the problem in Haskell by appealing to the laws of functional programming. Pearls of Functional Algorithm Design will appeal to the aspiring functional programmer, students and teachers interested in the principles of algorithm design, and anyone seeking to master the techniques of reasoning about programs in an equational style.