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

In this paper we consider the problem of extending Prolog to include predicate and function
variables and typed λ-terms. For this purpose, we use a higher-order logic to describe a …

The research on modular logic programming has evolved along two different directions
during the past decade. Various papers have focused primarily on the problems of …

The unification of simply typed λ-terms modulo the rules of ß-and η-conversions is often
called" higher-order" unification because of the possible presence of variables of functional …

Modern programming languages such as Lisp, Scheme and ML permit procedures to be
encapsulated within data in such a way that they can subsequently be retrieved and used to …

Type inference is the compile-time process of reconstructing missing type information in a
program based on the usage of its variables. ML and Haskell are two languages where this …

We argue that a logic programming language with a higher-order intuitionistic logic as its
foundation can be used both to naturally specify and implement tactic-style theorem provers …

It is an unfortunate reality that in" logic programming" as exemplified by Prolog few
interesting problems can be solved using the purely logical fragment of the language. The …

Bedwyr is a generalization of logic programming that allows model checking directly on
syntactic expressions possibly containing bindings. This system, written in OCaml, is a direct …

Software development is a complex and error prone task. Programming languages with
strong static type systems assist programmers by capturing and checking the fundamental …