From context-free to definite-clause grammars: a type-theoretic approach
- 31 January 1997
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 30 (1), 1-23
- https://doi.org/10.1016/s0743-1066(96)00015-5
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Higher-order Horn clausesJournal of the ACM, 1990
- Definite clause grammars for language analysis—A survey of the formalism and a comparison with augmented transition networksArtificial Intelligence, 1980
- Proving and applying program transformations expressed with second-order patternsActa Informatica, 1978
- A unification algorithm for typedTheoretical Computer Science, 1975
- A formulation of the simple theory of typesThe Journal of Symbolic Logic, 1940