Modeling Meta-logical Features in a Calculus with Frozen Variables

Authors:
Birgit Elbl
Affiliations:
-
Venue:
PTCS '01 Proceedings of the International Seminar on Proof Theory in Computer Science
Year:
2001

Citing 5
Cited 0

Linear logic

Theoretical Computer Science
Denotational and operational semantics for Prolog

Journal of Logic Programming
Proving termination properties of Prolog programs: a semantic approach

Journal of Logic Programming
A mathematical definition of full Prolog

Science of Computer Programming
Definitional Reflection and the Completion

ELP '93 Proceedings of the 4th International Workshop on Extensions of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider logic programming computations involving meta-logical predicates and connectives. The meaning of these elements depends on structural properties of the arguments, e.g. being an uninstantiated variable or a ground term when the goal is called, or involve success / failure conditions for the components which relates them to control. To model these effects we use a substructural calculus and introduce a binding mechanism at the level of sequents called freezing.