System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo Alpha-Equivalence

James Cheney, Christian Urban

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Alpha-Prolog is a prototype logic programming language with a built-in notion of binders and unification modulo alpha-equivalence. It is based on a mild extension of first-order Horn formulae: instead of the usual first-order terms and first-order unification, Alpha-Prolog uses nominal terms and nominal unification introduced in [3]. In this paper, we give three examples that demonstrate the advantages of Alpha-Prolog and describe our current implementation.
Original languageEnglish
Title of host publicationProceedings of the 17th International Workshop on Unification cheney
Publication statusPublished - 2003

Fingerprint

Dive into the research topics of 'System Description: Alpha-Prolog, a Fresh Approach to Logic Programming Modulo Alpha-Equivalence'. Together they form a unique fingerprint.

Cite this