Abstract
In [10] it was shown that it is possible to describe the set of normal inhabitants of a given type τ, in the standard simple type system, using an infinitary extension of the concept of context-free grammar, which allows for an infinite number of non-terminal symbols as well as production rules. The set of normal inhabitants of τ corresponds then to the set of terms generated by this, possibly infinitary, grammar plus all terms obtained from those by η-reduction. In this paper we show that the set of normal inhabitants of a type τ can in fact be described using a standard (finite) context-free grammar, and more interestingly that normal inhabitants of types with the same structure are described by identical context-free grammars, up to renaming of symbols. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Broda, S., & Damas, L. (2001). A context-free grammar representation for normal inhabitants of types in TAλ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2258 LNAI, pp. 321–334). Springer Verlag. https://doi.org/10.1007/3-540-45329-6_32
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
