"Snårkl: Somewhat Practical, Pretty Much Declarative Verifiable ..."

Gordon Stewart, Samuel Merten, Logan Leland (2018)

> Home

Details and statistics

DOI: 10.1007/978-3-319-73305-0_3

access: closed

type: Conference or Workshop Paper

metadata version: 2018-08-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/padl/StewartML18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/padl/StewartML18
Gordon Stewart, Samuel Merten, Logan Leland:
Snårkl: Somewhat Practical, Pretty Much Declarative Verifiable Computing in Haskell. PADL 2018: 36-52

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.