Alpha-Prolog: A Logic Programming Language with Names, Binding, and Alpha-Equivalence

Alpha-Prolog: A Logic Programming Language with Names, Binding, and Alpha-Equivalence (2004)

by James Cheney , Christian Urban

Citations:

30 - 9 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Alpha-Prolog: A Logic Programming Language with Names, Binding, and Alpha-Equivalence	user correction - Legacy Corrections
AUTHOR NAME	James Cheney	user correction - Legacy Corrections
AUTHOR NAME	Christian Urban	user correction - Legacy Corrections
ABSTRACT	There are two well-known approaches to programming with names, binding, and equivalence up to consistent renaming: representing names and bindings as concrete identifiers in a first-order language (such as Prolog), or encoding names and bindings as variables and abstractions in a higher-order language (such as Lambda-Prolog). However, both approaches have drawbacks: the former often involves stateful name-generation and requires manual definitions for alpha-equivalence and capture-avoiding substitution, and the latter is semantically very complicated, so reasoning about programs written using either approach can be very di#cult. Gabbay and Pitts have developed a new approach to encoding abstract syntax with binding based on primitive operations of name-swapping and freshness. This paper presents Alpha-Prolog, a logic programming language that uses this approach, along with several illustrative example programs and an operational semantics.	user correction - Legacy Corrections
YEAR	2004	user correction - Legacy Corrections
CITATIONS	7 found	ParsCit 1.0