Ian Zerny

11 papers C 4Misc 1Journal 3Unranked 3
YearRankTypeTitle / Venue / Authors
2013 C conf
A logical correspondence between natural semantics and abstract machines.
PPDP
Robert J. Simmons, Ian Zerny
2013 C conf
A synthetic operational account of call-by-need evaluation.
PPDP
Olivier Danvy, Ian Zerny
2013 — conf
Circularity and Lambda Abstraction: From Bird to Pettorossi and back.
IFL
Olivier Danvy, Peter Thiemann, Ian Zerny
2013 J jnl
On graph rewriting, reduction, and evaluation in the presence of cycles.
High. Order Symb. Comput.
Ian Zerny
2013 J jnl
Three syntactic theories for combinatory graph reduction.
ACM Trans. Comput. Log.
Olivier Danvy, Ian Zerny
2012 J jnl
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation.
Theor. Comput. Sci.
Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny
2011 C conf
A walk in the semantic park.
PEPM
Olivier Danvy, Jacob Johannsen, Ian Zerny
2010 Misc conf
Defunctionalized Interpreters for Call-by-Need Evaluation.
FLOPS
Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny
2010 C conf
Three Syntactic Theories for Combinatory Graph Reduction.
LOPSTR
Olivier Danvy, Ian Zerny
2009 — conf
J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations.
DSL
Olivier Danvy, Chung-chieh Shan, Ian Zerny
2009 — conf
On Graph Rewriting, Reduction and Evaluation.
Trends in Functional Programming
Ian Zerny
2023 — conf
Not What You've Signed Up For: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection.
AISec
Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz
2026 — preprint
CCX: Enabling Unmodified Intel SGX Applications on Arm CCA.
arXiv
Matti Schulze, Thorsten Holz, Felix C. Freiling