A call-by-need lambda calculus ZM Ariola, J Maraist, M Odersky, M Felleisen, P Wadler Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of …, 1995 | 500 | 1995 |

Equational term graph rewriting ZM Ariola, JW Klop Fundamenta Informaticae 26 (3-4), 207-240, 1996 | 175 | 1996 |

Minimal classical logic and control operators ZM Ariola, H Herbelin Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003 | 113 | 2003 |

Lambda calculus with explicit recursion ZM Ariola, JW Klop Information and computation 139 (2), 154-233, 1997 | 98 | 1997 |

Cyclic lambda graph rewriting ZM Ariola, JW Klop Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 416-425, 1994 | 86 | 1994 |

Cyclic lambda calculi ZM Ariola, S Blom International Symposium on Theoretical Aspects of Computer Software, 77-106, 1997 | 84 | 1997 |

Skew confluence and the lambda calculus with letrec ZM Ariola, S Blom Annals of pure and applied logic 117 (1-3), 95-168, 2002 | 58 | 2002 |

Properties of a first-order functional language with sharing ZM Ariola Theoretical Computer Science 146 (1-2), 69-108, 1995 | 56 | 1995 |

Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates AVS Sastry, W Clinger, Z Ariola Proceedings of the conference on Functional programming languages and …, 1993 | 56 | 1993 |

Compiling without continuations L Maurer, P Downen, ZM Ariola, S Peyton Jones Proceedings of the 38th ACM SIGPLAN Conference on Programming Language …, 2017 | 53 | 2017 |

A type-theoretic foundation of delimited continuations ZM Ariola, H Herbelin, A Sabry Higher-order and symbolic computation 22, 233-273, 2009 | 52 | 2009 |

A type-theoretic foundation of continuations and prompts ZM Ariola, H Herbelin, A Sabry ACM SIGPLAN Notices 39 (9), 40-53, 2004 | 48 | 2004 |

Classical call-by-need and duality ZM Ariola, H Herbelin, A Saurin International Conference on Typed Lambda Calculi and Applications, 27-44, 2011 | 37 | 2011 |

P-TAC: a parallel intermediate language Z Ariola, Arvind Proceedings of the fourth international conference on Functional programming …, 1989 | 36 | 1989 |

From syntactic theories to interpreters: Automating the proof of unique decomposition Y Xiao, A Sabry, ZM Ariola Higher-Order and Symbolic Computation 14, 387-409, 2001 | 35 | 2001 |

A proof-theoretic foundation of abortive continuations ZM Ariola, H Herbelin, A Sabry Higher-order and symbolic computation 20 (4), 403-429, 2007 | 34 | 2007 |

The duality of construction P Downen, ZM Ariola Programming Languages and Systems: 23rd European Symposium on Programming …, 2014 | 32 | 2014 |

Classical call-by-need sequent calculi: The unity of semantic artifacts ZM Ariola, P Downen, H Herbelin, K Nakata, A Saurin Functional and Logic Programming: 11th International Symposium, FLOPS 2012 …, 2012 | 32 | 2012 |

Sequent calculi and abstract machines ZM Ariola, A Bohannon, A Sabry ACM Transactions on Programming Languages and Systems (TOPLAS) 31 (4), 1-48, 2009 | 32 | 2009 |

Correctness of monadic state: An imperative call-by-need calculus ZM Ariola, A Sabry Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of …, 1998 | 32 | 1998 |