Skip to main content
Log in

Dynamic interpretations of constraint-based grammar formalisms

  • Published:
Journal of Logic, Language and Information Aims and scope Submit manuscript

Abstract

We present a rendering of some common grammatical formalisms in terms of evolving algebras. Though our main concern in this paper is on constraint-based formalisms, we also discuss the more basic case of context-free grammars. Our aim throughout is to highlight the use of evolving algebras as a specification tool to obtain grammar formalisms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • E. Börger, 1994, “Annotated bibliography on evolving algebras,” inSpecification and Validation Methods, E. Börger, ed., Oxford University Press. Paper available by anonymous ftp from: apollo.di.unipi.it in the directory pub/Papers/boerger.

  • B. Carpenter, 1992,The Logic of Typed Feature Structures, Cambridge Tracts in Theoretical Computer Science 32, Cambridge University Press.

  • A. Dawar and K. Vijay-Shankar, 1990, “A three-valued interpretation of negation in feature structure descriptions,”Computational Linguistics 16(1), 11–21.

    Google Scholar 

  • Y. Gurevich and L.S. Moss, 1990, “Algebraic operational semantics and Occam,” inProceedings of 3rd Workshop on Computer Science Logic, Springer-Verlag LNCS, volume 440.

  • Y. Gurevich, 1991, “Evolving algebras: A tutorial introduction,”Bulletin of the European Association for Theoretical Computer Science 43, 264–286.

    Google Scholar 

  • Y. Gurevich, 1994, “Evolving algebras 1993: Lipari guide,” inSpecification and Validation Methods, E. Börger, ed., Oxford University Press.

  • D. E. Johnson and L. S. Moss, 1995, “Grammar formalisms viewed as evolving algebras,”Linguistics and Philosophy.

  • M. Johnson, 1988, “Attribute-Value Logic and the Theory of Grammar,” CSLI Lecture Notes Number 16, CSLI.

  • B. Keller, 1993, “Feature Logics, Infinitary Descriptions, and Grammar,” CSLI Lecture Notes Number44, CSLI.

  • M. A. Moshier, 1988,Extensions to Unification Grammar for the Description of Programming Languages, PhD thesis, University of Michigan.

  • M. A. Moshier and W. C. Rounds, “A logic for partially specified data structures,” inProceedings of 14th ACM Symposium on Principles of Programming Languages, pp. 156–167.

  • L. S. Moss and D. E. Johnson, 1995, “Evolving algebras and mathematical models of language,” pp. 143–175, inApplied Logic: How, What, and Why?, Dordrecht: Kluwer Academic Publishers.

    Google Scholar 

  • W. C. Rounds, “Feature logic,” inHandbook of Logic and Language, J. van Beninern and A. ter Meulen eds., Amsterdam: North Holland.

  • S. M. Shieber, 1992,Constraint-Based Grammar Formalisms, MIT Press, Cambridge, Massachusetts: Bradford Books.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Moss, L.S., Johnson, D.E. Dynamic interpretations of constraint-based grammar formalisms. J Logic Lang Inf 4, 61–79 (1995). https://doi.org/10.1007/BF01048405

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01048405

Key words

Navigation