"A Notion of a Computational Step for Partial Combinatory Algebras."

Nathanael L. Ackerman, Cameron E. Freer (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-38236-9_13

access: closed

type: Conference or Workshop Paper

metadata version: 2019-06-04

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/tamc/AckermanF13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/AckermanF13
Nathanael L. Ackerman, Cameron E. Freer:
A Notion of a Computational Step for Partial Combinatory Algebras. TAMC 2013: 133-143

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.