Term Sequent Logic

DOI10.1016/j.entcs.2009.07.017zbMath1347.68050OpenAlexW2132717091MaRDI QIDQ4982627

Michael Gabbay

Publication date: 9 April 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.07.017

zbMATH Keywords

cut eliminationproof theoryfunctional programminglambda calculus

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)

Related Items (1)

RULES FOR SUBATOMIC DERIVATION

Uses Software

• Lolli

Cites Work

• Unnamed Item
• Unnamed Item
• A new approach to abstract syntax with variable binding
• Conditional term rewriting systems. 1st international workshop. Orsay, France, July 8--10, 1987. Proceedings
• Logic programming in a fragment of intuitionistic linear logic
• What is Logic?
• A Logic Programming Language with Lambda-Abstraction, Function Variables, and Simple Unification
• The Logic of Bunched Implications
• Term Rewriting and All That
• Automated Reasoning
• Term Rewriting and Applications

This page was built for publication: Term Sequent Logic