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

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 …

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 …

When logic programming is based on the proof theory of intuitionistic logic, it is natural to
allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the …

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 …

Formal systems that describe computations over syntactic structures occur frequently in
computer science. Logic programming provides a natural framework for encoding and …

I am very happy to have this opportunity to introduce Luca Vigano's book on Labelled Non-
Classical Logics. I put forward the methodology of labelled deductive systems to the …

Unification problems are identified with conjunctions of equations between simply typed λ-
terms where free variables in the equations can be universally or existentially quantified …