Searching for "The Complexity of Type Inference for Higher-Order Typed Lambda Calculi." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

The Complexity of Type Inference for Higher-Order Typed Lambda Calculi
by Fritz Henglein, Harry G. Mairson — 1991 — J. Funct. Programming
…The Complexity of Type Inference for Higher-Order Typed Lambda Calculi Fritz Henglein y DIKU…
Cited by 25 (10 self) – Add To MetaCart

A simple proof of a theorem of Statman
by Harry G. Mairson — 1992 — Theoretical Computer Science
…] on these succinct formulas. The recent results on complexity of type inference for higher-order typed lambda calculi…
Cited by 16 (5 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB