Uniform Proofs as a Foundation for Logic Programming

Miller, D., Nadathur, G., Pfenning, F., & Scedrov, A. (1991). Uniform Proofs as a Foundation for Logic Programming. Annals of Pure and Applied Logic, 0072(91), 125-157.

Type

Journal article

Intellectual base

Primary research

Year

1991

DOI

10.1016/0168-0072(91)90068-w

Link

https://doi.org/10.1016/0168-0072(91)90068-w

Cited by

1 citation across 1 artifact.

Domain-specific

• Harrop Formula
  • The hereditary extension separates program clauses from goals so operational proof search remains aligned with intuitionistic provability.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:03d9fc3db332 · see in the full table