Types in logic programming

Author(s)

• Pfenning, Frank

Bibliographic Information

Types in logic programming

edited by Frank Pfenning

（Logic programming）

MIT Press, c1992

Note

Includes bibliographical references and index

Description and Table of Contents

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.

Table of Contents

• Part 1 A semantics for typed logic programmes, P.M. Hill and R.W. Topor: type languages
• first-order typed languages and theories
• a semantics for typed theories
• typed logic programmes and goals. Part 2 Polymorphically typed logic programmes, Eyal Yardeni, et al: syntax
• semantics
• well-typing and type checking
• extensions of the type language. Part 3 Logic programming with type specifications, Michael Hanus: overview and examples
• logic programmes with type specifications
• semantics of typed logic programmes
• deduction and initial models
• unifications
• resolution
• applications. Part 4 Semantic types for logic programmes, Nevin Heintze and Joxan Jaffar: preliminaries
• set formulas
• fixpoint operators
• main results. Part 5 A regular type language for logic programmes, Philip W. Dart and Justin Zobel: regular types
• identification of regular types
• operations on regular types
• type unification
• parametric type rules
• related work. Part 6 Types and intended meaning, Lee Naish: the standard semantics
• specification = programme
• specification does not equal programme
• specification = programme + types
• programme correctness
• verification
• implications for declarative debugging
• type analysis for detecting programming errors. Part 7 A pragmatic view of types for logic programmes, Dean Jacobs: moded logic programmes
• preventing mode violations
• application to types. Part 8 Moded type systems to support abstraction, Joseph L. Zachary and Katherine A. Yelick: approach
• properties of moded resolution
• syntactic issues. Part 9 Types in higher-order logic programming, Gopalan Nadathur and Frank Pfenning: the language prologue
• the role of types in the system
• approaches to type reconstruction. Part 10 Dependent types in logic programming, Frank Pfenning: simple and dependent types
• the methodology of the LF logical framework
• the programming language Elf. Part 11 The type system of LML, Bruno Bertolino, et al: an overview of LML
• the type system.

by "Nielsen BookData"

Details

• NCID: BA18233228
• ISBN:
  • 0262161311
• LCCN: 92013988
• Country Code: us
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Cambridge, Mass.
• Pages/Volumes: xviii, 357 p.
• Size: 24 cm
• Classification:
  • LCC : QA76.63
  • DC20 : 005.1/1
• Subject Headings:
  • LCSH : Logic programming
• Parent Bibliography ID:
  • BA07047811