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.

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.

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.

Practical Foundations for Programming Languages
Practical Foundations for Programming Languages

Author: Robert Harper

Publisher: Cambridge University Press

Published: 2016-04-04

Total Pages: 513

ISBN-13: 1107150302

DOWNLOAD EBOOK

This book unifies a broad range of programming language concepts under the framework of type systems and structural operational semantics.

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.

Handbook of Proof Theory
Handbook of Proof Theory

Author: S.R. Buss

Publisher: Elsevier

Published: 1998-07-09

Total Pages: 823

ISBN-13: 0080533183

DOWNLOAD EBOOK

This volume contains articles covering a broad spectrum of proof theory, with an emphasis on its mathematical aspects. The articles should not only be interesting to specialists of proof theory, but should also be accessible to a diverse audience, including logicians, mathematicians, computer scientists and philosophers. Many of the central topics of proof theory have been included in a self-contained expository of articles, covered in great detail and depth.The chapters are arranged so that the two introductory articles come first; these are then followed by articles from core classical areas of proof theory; the handbook concludes with articles that deal with topics closely related to computer science.