[PDF][PDF] Higher order logic.

D Leivant - Handbook of Logic in Artificial Intelligence and Logic …, 1994 - Citeseer
Higher order logics, long considered by many to be an esoteric subject, are increasingly
recognized for their foundational importance and practical usefulness, notably in Theoretical …

The logic of typed feature structures

RL Carpenter - (No Title), 1992 - cir.nii.ac.jp
抄録< jats: p> This book develops the theory of typed feature structures, a data structure that
generalizes both first-order terms and feature structures of unification-based grammars to …

Abstract interpretation and application to logic programs

P Cousot, R Cousot - The Journal of Logic Programming, 1992 - Elsevier
Abstract interpretation is a theory of semantics approximation that is used for the
construction of semantic-based program analysis algorithms (sometimes called “data flow …

The execution algorithm of Mercury, an efficient purely declarative logic programming language

Z Somogyi, F Henderson, T Conway - The Journal of Logic Programming, 1996 - Elsevier
We introduce Mercury, a new purely declarative logic programming language designed to
provide the support that groups of application programmers need when building large …

[图书][B] Artificial intelligence and the design of expert systems

GF Luger, WA Stubblefield - 1990 - dl.acm.org
Artificial Intelligence and the Design of Expert Systems | Guide books skip to main content
ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse About …

[图书][B] Programming with higher-order logic

D Miller, G Nadathur - 2012 - books.google.com
Formal systems that describe computations over syntactic structures occur frequently in
computer science. Logic programming provides a natural framework for encoding and …

[图书][B] The Gödel programming language

P Hill, JW Lloyd - 1994 - books.google.com
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 …

Type inference with polymorphic recursion

F Henglein - ACM Transactions on Programming Languages and …, 1993 - dl.acm.org
We present some reasons why type inference with polymorphic recursion appears to be
practical despite its undecidability. This also sheds some light on the observed practicality of …

Fifty years of Prolog and beyond

P Körner, M Leuschel, J Barbosa, VS Costa… - Theory and Practice of …, 2022 - cambridge.org
Both logic programming in general and Prolog in particular have a long and fascinating
history, intermingled with that of many disciplines they inherited from or catalyzed. A large …

Types as abstract interpretations

P Cousot - Proceedings of the 24th ACM SIGPLAN-SIGACT …, 1997 - dl.acm.org
Starting from a denotational semantics of the eager untyped lambda-calculus with explicit
runtime errors, the standard collecting semantics is defined as specifying the strongest …