Counting a type's (principal) inhabitants

• Autorzy: Broda S. , Damas L.
• Języki publikacji: EN

Abstrakty

EN

We present a Counting Algorithm that computes the number of l-terms in b-normal form that have a given type t as a principal type and produces a list of these terms. The design of the algorithm follows the lines of Ben-Yelles' algorithm for counting normal (not necessarily principal) inhabitants of a type t. Furthermore, we show that one can use similar algorithms with adequate limits to count normal and principal normal inhabitants in the lI-calculus.

Słowa kluczowe

EN

Counting Algorithm

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2001
• Tom: Vol. 45, nr 1,2
• Strony: 33--51
• Opis fizyczny: bibliogr. 7 poz.

Twórcy

autor

Broda S.

autor

Damas L.

• CC&LIACC, Universidade do Porto R.do Campo Alerge 823, 4150-180 Porto, Portugal,