Ian Zerny

According to our database, Ian Zerny authored at least 10 papers between 2009 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2013

Three syntactic theories for combinatory graph reduction.

Olivier Danvy, Ian Zerny

ACM Trans. Comput. Log., 2013

On graph rewriting, reduction, and evaluation in the presence of cycles.

Ian Zerny

High. Order Symb. Comput., 2013

A logical correspondence between natural semantics and abstract machines.

Robert J. Simmons, Ian Zerny

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

A synthetic operational account of call-by-need evaluation.

Olivier Danvy, Ian Zerny

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

Circularity and Lambda Abstraction: From Bird to Pettorossi and back.

Olivier Danvy, Peter Thiemann, Ian Zerny

Proceedings of the 25th Symposium on Implementation and Application of Functional Languages, 2013

2012

On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation.

Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny

Theor. Comput. Sci., 2012

2011

A walk in the semantic park.

Olivier Danvy, Jacob Johannsen, Ian Zerny

Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2011

2010

Defunctionalized Interpreters for Call-by-Need Evaluation.

Olivier Danvy, Kevin Millikin, Johan Munk, Ian Zerny

Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009

On Graph Rewriting, Reduction and Evaluation.

Ian Zerny

Proceedings of the Tenth Symposium on Trends in Functional Programming, 2009

J Is for JavaScript: A Direct-Style Correspondence between Algol-Like Languages and JavaScript Using First-Class Continuations.

Olivier Danvy, Chung-chieh Shan, Ian Zerny

Proceedings of the Domain-Specific Languages, IFIP TC 2 Working Conference, 2009