681 search results - page 77 / 137 » Parsing as Natural Deduction |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
110
click to vote
IGPL
2007
14 years 9 months ago
2007
We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasize...
ENTCS
2002
14 years 9 months ago
2002
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
103
click to vote
MSCS
2000
14 years 9 months ago
2000
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
JAR
2002
14 years 9 months ago
2002
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn indices for variable binding. The main judgement we model is of the form d [:] , ...