Term rewriting and all that
On the algebraic models of Lambda calculus
Theoretical Computer Science - Modern algebra and its applications
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Rewriting logic: roadmap and bibliography
Theoretical Computer Science - Rewriting logic and its applications
Definitional Reflection and the Completion
ELP '93 Proceedings of the 4th International Workshop on Extensions of Logic Programming
A Congruence Theorem for Structured Operational Semantics of Higher-Order Languages
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
A Proof Theory for Generic Judgments: An extended abstract
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
A Sequent Calculus for Nominal Logic
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
On a monadic semantics for freshness
Theoretical Computer Science - Applied semantics: Selected topics
Information and Computation
Capture-avoiding substitution as a nominal algebra
Formal Aspects of Computing
| Hi-index | 0.00 |
We present an extension of first-order predicate logic with a novel predicate 'att' meaning intuitively ''this term is a variable symbol''. We give simple sequent proof-rules for it, we demonstrate cut-elimination for the resulting logic, and we give a semantics for which the logic is sound and complete. Because we can now make assertions about what would normally be considered an intensional property of a term (being a variable symbol) we can now express inside the logic, properties of its terms and predicates which would normally be external to the logic. We give axiomatisations in a-logic, including of the lambda-calculus, and discuss what relevance this might have to logic programming.