"Deciding ML Typability is Complete for Deterministic Exponential Time."

Harry G. Mairson (1990)

> Home

Details and statistics

DOI: 10.1145/96709.96748

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/popl/Mairson90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/popl/Mairson90
Harry G. Mairson:
Deciding ML Typability is Complete for Deterministic Exponential Time. POPL 1990: 382-401

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.