Polymorphic Syntax Definition

@article{Visser1997PolymorphicSD,
  title={Polymorphic Syntax Definition},
  author={Eelco Visser},
  journal={Theor. Comput. Sci.},
  year={1997},
  volume={199},
  pages={57-86}
}
Context-free grammars are used in several algebraic specification formalisms instead of first-order signatures for the definition of the structure of algebras, because grammars provide better notation than signatures. The rigidity of these first-order structures enforces a choice between strongly typed structures with little genericity or generic operations over untyped structures. In two-level signatures level 1 defines the algebra of types used at level 0 providing the possibility to define… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 22 REFERENCES

On speci cations, theories, and models with higher types

A. e
  • 1986
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

CONTEXT-FREE ALGEBRAS

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Algebras with a Scheme of Operators

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

The Design and Implementation of Typed Languages

B. M. Hearn
  • 1995
VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

Universal Algebra in Higher Types

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Parsing as Deduction

VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

A theory of type polymorphism in programming

R. Milner
  • Journal
  • 1978
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL