The set of unifiers in typed &lgr;-calculus as regular expression

Authors:
Marek Zaionc
Affiliations:
Jagiellonian Univ., Krako´w, Poland
Venue:
Proc. of the first international conference on Rewriting techniques and applications
Year:
1985

Higher-order unification revisited: Complete sets of transformations

Journal of Symbolic Computation
Counting a Type's Principal Inhabitants

TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Counting a Type's (Principal) Inhabitants

Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Probabilistic Approach to the Lambda Definability for Fourth Order Types

Electronic Notes in Theoretical Computer Science (ENTCS)
Counting a Type's (Principal) Inhabitants

Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)

Hi-index	0.00