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

Fritz Henglein, Harry G. Mairson (1991)

> Home

Details and statistics

DOI: 10.1145/99583.99602

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/popl/HengleinM91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/HengleinM91
Fritz Henglein, Harry G. Mairson:
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi. POPL 1991: 119-130

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.