Researchers have recently achieved significant advances in deep learning techniques,
which in turn has substantially advanced other research disciplines, such as natural …

XProlog is a logic programming language that extends Prolog by incorporating notions of
higher-order functions, A-terms, higher-order unification, polymorphic types, and …

The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is
based on a general treatment of syntax, rules, and proofs by means of a typed λ-calculus …

It is now 10 years ago that two of us took the train to Stockholm to meet Per Martin-Löf and
discuss his ideas on the connection between type theory and computing science. This book …

We describe motivation, design, use, and implementation of higher-order abstract syntax as
a central representation for programs, formulas, rules, and other syntactic objects in program …

Abstract Miller, D., G. Nadathur, F. Pfenning and A. Scedrov, Uniform proofs as a foundation
for logic programming, Annals of Pure and Applied Logic 51 (1991) 125–157. A proof …

It has been argued elsewhere that a logic programming language with function variables
and λ-abstractions within terms makes a good meta-programming language, especially …

Abstract Isabelle [28, 30] is an interactive theorem prover that supports a variety of logics. It
represents rules as propositions (not as functions) and builds proofs by combining rules …

Isabelle is a generic theorem prover, designed for interactive reasoning in a variety of formal
theories. At present it provides useful proof procedures for Constructive Type Theory (Per …

Isabelle, which is available from http://isabelle. in. tum. de, is a generic framework for
interactive theorem proving. The Isabelle/Pure meta-logic allows the formalization of the …