"Declarative and Imperative Approaches for Proving Turing Completeness of ..."

Emilia Golemanova, Tzanko Golemanov (2020)

> Home

Details and statistics

DOI: 10.1145/3407982.3407993

access: closed

type: Conference or Workshop Paper

metadata version: 2021-12-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compsystech/GolemanovaG20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compsystech/GolemanovaG20
Emilia Golemanova, Tzanko Golemanov:
Declarative and Imperative Approaches for Proving Turing Completeness of SPIDER. CompSysTech 2020: 94-100

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.