Skip to content

Opening book details…

About this Computer Science article

The Complexity of Type Inference for Higher-order Typed Lambda Calculi by Henglein, Fritz; Mairson, Harry G. is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Henglein, Fritz; Mairson, Harry G.
Publisher
Cambridge University Press; Cambridge University Press (CUP) (ISSN 0956-7968)
Published
1994
Language
EN
Field
Computer Science (Physical Sciences)

More by Henglein, Fritz; Mairson, Harry G.

Browse all works by Henglein, Fritz; Mairson, Harry G.