› › Types In Logic Programming

Types in Logic Programming

Author : Frank Pfenning

Publisher : MIT Press

Page : 388 pages

File Size : 33,34 MB

Release : 1992

Category : Computers

ISBN : 9780262161312

Get eBook

Book Description

This collection of original research papers assesses and summarizes the impact of types on logic programming. Type theory is a well-established branch of theoretical computer science that has played an important role in the development of imperative and functional programming languages. This collection of original research papers assesses and summarizes the impact of types on logic programming. It covers all of the major themes in this burgeoning field, including simple types, regular tree types, polymorphic types, subtypes, and dependent types. Language design issues as well as semantics, pragmatics, and applications of types are discussed.The benefits that type considerations have to offer logic programming are being increasingly realized: through type checking many errors can be caught before a program is run, resulting in more reliable programs; types form an expressive basis for module systems, since they prescribe a machine-verifiable interface for the code encapsulated within a module; and types may be used to improve performance of code generated by a compiler. The research in this collection describes these benefits as well as important differences in the impact of types in functional and logic programming.





Logic Programming with Prolog

Author : Max Bramer

Publisher : Springer Science & Business Media

Page : 228 pages

File Size : 48,65 MB

Release : 2005-11-30

Category : Computers

ISBN : 1846282128

Get eBook

Book Description

Written for those who wish to learn Prolog as a powerful software development tool, but do not necessarily have any background in logic or AI. Includes a full glossary of the technical terms and self-assessment exercises.



Programming with Higher-Order Logic

Author : Dale Miller

Publisher : Cambridge University Press

Page : 321 pages

File Size : 27,53 MB

Release : 2012-06-11

Category : Computers

ISBN : 1139510428

Get eBook

Book Description

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.



From Logic Programming to Prolog

Author : Krzysztof R. Apt

Publisher :

Page : 358 pages

File Size : 38,79 MB

Release : 1997

Category : Computers

ISBN :

Get eBook

Book Description

Provides a systematic introduction to the theory of logic programming and shows how this theory can be applied to reason about pure Prolog programs. The text includes an introduction to programming in Prolog and deals with such programming issues as determination, occur-check freedom and absence of errors. It covers both the natural interpretations of logic programming, as declarative specification and as procedure for computer execution.



The Reasoned Schemer, second edition

Author : Daniel P. Friedman

Publisher : MIT Press

Page : 206 pages

File Size : 25,76 MB

Release : 2018-03-09

Category : Computers

ISBN : 0262535513

Get eBook

Book Description

A new edition of a book, written in a humorous question-and-answer style, that shows how to implement and use an elegant little programming language for logic programming. The goal of this book is to show the beauty and elegance of relational programming, which captures the essence of logic programming. The book shows how to implement a relational programming language in Scheme, or in any other functional language, and demonstrates the remarkable flexibility of the resulting relational programs. As in the first edition, the pedagogical method is a series of questions and answers, which proceed with the characteristic humor that marked The Little Schemer and The Seasoned Schemer. Familiarity with a functional language or with the first five chapters of The Little Schemer is assumed. For this second edition, the authors have greatly simplified the programming language used in the book, as well as the implementation of the language. In addition to revising the text extensively, and simplifying and revising the “Laws” and “Commandments,” they have added explicit “Translation” rules to ease translation of Scheme functions into relations.



The Little Typer

Author : Daniel P. Friedman

Publisher : MIT Press

Page : 418 pages

File Size : 33,41 MB

Release : 2018-09-18

Category : Computers

ISBN : 0262536439

Get eBook

Book Description

An introduction to dependent types, demonstrating the most beautiful aspects, one step at a time. A program's type describes its behavior. Dependent types are a first-class part of a language, and are much more powerful than other kinds of types; using just one language for types and programs allows program descriptions to be as powerful as the programs they describe. The Little Typer explains dependent types, beginning with a very small language that looks very much like Scheme and extending it to cover both programming with dependent types and using dependent types for mathematical reasoning. Readers should be familiar with the basics of a Lisp-like programming language, as presented in the first four chapters of The Little Schemer. The first five chapters of The Little Typer provide the needed tools to understand dependent types; the remaining chapters use these tools to build a bridge between mathematics and programming. Readers will learn that tools they know from programming—pairs, lists, functions, and recursion—can also capture patterns of reasoning. The Little Typer does not attempt to teach either practical programming skills or a fully rigorous approach to types. Instead, it demonstrates the most beautiful aspects as simply as possible, one step at a time.



Logic Programming

Author : Christoph Beierle

Publisher : Elsevier Publishing Company

Page : 428 pages

File Size : 36,20 MB

Release : 1995

Category : Computers

ISBN :

Get eBook

Book Description

This text aims at promoting a convergence between the technical challenges of developing advanced software systems and the formal techniques, tools and features evolving from the logic programming paradigm. It provides contributions towards different apsects of logic programming.



Types and Programming Languages

Author : Benjamin C. Pierce

Publisher : MIT Press

Page : 656 pages

File Size : 22,86 MB

Release : 2002-01-04

Category : Computers

ISBN : 9780262162098

Get eBook

Book Description

A comprehensive introduction to type systems and programming languages. A type system is a syntactic method for automatically checking the absence of certain erroneous behaviors by classifying program phrases according to the kinds of values they compute. The study of type systems—and of programming languages from a type-theoretic perspective—has important applications in software engineering, language design, high-performance compilers, and security. This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages. The approach is pragmatic and operational; each new concept is motivated by programming examples and the more theoretical sections are driven by the needs of implementations. Each chapter is accompanied by numerous exercises and solutions, as well as a running implementation, available via the Web. Dependencies between chapters are explicitly identified, allowing readers to choose a variety of paths through the material. The core topics include the untyped lambda-calculus, simple type systems, type reconstruction, universal and existential polymorphism, subtyping, bounded quantification, recursive types, kinds, and type operators. Extended case studies develop a variety of approaches to modeling the features of object-oriented languages.



The Gödel Programming Language

Author : Patricia Hill

Publisher : MIT Press

Page : 384 pages

File Size : 32,1 MB

Release : 1994

Category : Computers

ISBN : 9780262082297

Get eBook

Book Description

This book gives a tutorial overview of Gödel, presents example programs, provides a formal definition of the syntax and semantics of the language, and covers background material on logic. Gödel is a new, general-purpose, declarative programming language that is based on the paradigm of logic programming and can be regarded as a successor to Prolog. This book gives a tutorial overview of Gödel, presents example programs, provides a formal definition of the syntax and semantics of the language, and covers background material on logic. The Gödel language supports types and modules. It has a rich collection of system modules and provides constraint solving in several domains. It also offers metalogical facilities that provide significant support for metaprograms that do analysis, transformation, compilation, verification, debugging, and the like. The declarative nature of Gödel makes it well suited for use as a teaching language, narrows the gap that currently exists between theory and practice in logic programming, makes possible advanced software engineering tools such as declarative debuggers and compiler generators, reduces the effort involved in providing a parallel implementation of the language, and offers substantial scope for parallelization in such implementations. Logic Programming series