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.
Frank Pfenning is Research Computer Scientist in the School of Computer Science at Carnegie Mellon University.
Ask a Question About this Product More... |