"Implicit computation complexity in higher-order programming languages: A ..."

Ugo Dal Lago (2022)

> Home

Details and statistics

DOI: 10.1017/S0960129521000505

access: closed

type: Journal Article

metadata version: 2023-02-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mscs/Lago22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mscs/Lago22
Ugo Dal Lago:
Implicit computation complexity in higher-order programming languages: A Survey in Memory of Martin Hofmann. Math. Struct. Comput. Sci. 32(6): 760-776 (2022)

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.