"The Complexity of Type Inference for Higher-Order Typed lambda Calculi."

Fritz Henglein, Harry G. Mairson (1994)

> Home

Details and statistics

DOI: 10.1017/S0956796800001143

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jfp/HengleinM94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jfp/HengleinM94
Fritz Henglein, Harry G. Mairson:
The Complexity of Type Inference for Higher-Order Typed lambda Calculi. J. Funct. Program. 4(4): 435-477 (1994)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.