Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
PADL
/
Paper
Snrkl: Somewhat Practical, Pretty Much Declarative Verifiable Computing in Haskell.
Gordon Stewart
,
Samuel Merten
,
Logan Leland
Venue
C
PADL
Year
2018
Proceedings
PADL
DBLP record
conf/padl/StewartML18 ↗
Browse the full
PADL paper archive
.