Combinators for Paraconsistent Attitudes
LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Hi-index | 0.00 |
We describe a Prolog implementation of the sequent calculus for the type theory Nabla that can make syntactical and semantical analyses of a fragment of natural language using combinators.