Publications

Refereed Conferences:

• Z. M. Ariola and Arvind. P-TAC: A Parallel Intermediate Language. In Proc. ACM Conference on Functional Programming Languages and Computer Architecture. Imperial College, London, September 1989. (Also: CSG Memo 295, MIT Laboratory for Computer Science.)

• Z. M. Ariola and Arvind. A Syntactic Approach to Program Transformation. In Proc. ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation. Yale University, New Haven, June 1991. (Also: CSG Memo 322, MIT Laboratory for Computer Science.)

• Z. M. Ariola and Arvind. Graph Rewriting Systems. In Proc. Symposium on Semantics and Pragmatics of Generalized Graph Rewriting. University of Nijmegen, The Netherlands, December 1991. (Extended version in the book "Term Graph Rewriting: Theory and Practice", published by John Wiley & Sons 1993, editors M. R. Sleep and M. J. Plasmeijer and M. C. D. J. van Eekelen.)

• Z. M. Ariola and Arvind. Compilation of Id. In Proc. of the Fourth Workshop on Languages and Compilers for Parallel Computing. Santa Clara, California, August 1991. (Also: CSG Memo 341, MIT Laboratory for Computer Science.)

• Z. M. Ariola, J. W. Klop, J. R. Kennaway, F. J. de Vries and M. R. Sleep. Syntactic Definitions of Undefined: On Defining the Undefined. TACS 94, Sendai, Japan.

• A.V. Sastry, W. Clinger, Z. M. Ariola. Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates. In Proc. ACM Conference on Functional Programming Languages and Computer Architecture. University of Copenhagen, Denmark, June 1993.

• Z. M. Ariola. Relation between Graph and Term Rewriting through a Böhm Model. In Proc. of the Fifth International Conference, on Rewriting Techniques and Applications, Montreal, Canada June 1993.

• Z. M. Ariola and J.W. Klop. Cyclic Lambda Graph Rewriting. In Proc. of the Eight IEEE Symposium on Logic in Computer Science, Paris, July 1994.

• Z. M. Ariola, M. Felleisen, Maraist, Odersky and Wadler. A Call-by-Need Lambda Calculus. In Proc. of the 22nd ACM Symposium on Principles of Programming Languages, San Francisco, January 1995.

• Z. M. Ariola, Stefan Blom. Cyclic Lambda Calculi. TACS 97, Sendai, Japan.

• Sergio Antoy. Z. M. Ariola, Narrowing the narrowing space. 9th Int'l Symp. on Programming Languages, Implementations, Logics, and Programs, Southampton, UK, Sept. 1997.

• Z. M. Ariola, A. Sabry, Correctness of monadic state: an imperative call-by-need calculus. In Proc. of the 25nd ACM Symposium on Principles of Programming Languages, San Diego, January 1998.

• Y. Xiao, Z. M. Ariola and M. Mauny. From Syntactic Theories to Interpreters: A Specification Language and Its Compilation. First International Workshop on Rule-Based Programming. Montreal, Canada.

• Z. M. Ariola, H. Herbelin. Minimal Classical Logic. ICALP2003.

• Z. M. Ariola, H. Herbelin Amr Sabry . A Type-Theoretic Foundation of Continuations and Prompts. ICFP2004.

• A. Bohannon, Z. M. Ariola and A. Sabry. A Typed Calculus Supporting Shallow Embeddings of Abstract Machines. Workshop on the Krivine and ZINC Abstract Machines (KAZAM2005).

• Z. M. Ariola and S. Blom. Skew and omega-Skew Confluence and Abstract Bohm Semantics. In Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Kl op, on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 3838, Springer 2005.

• Z. M. Ariola and H. Herbelin and A. Saurin. Classical call-by-need and duality. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 27--44, Novi Sad, Serbia (TLCA2011).

• Z. M. Ariola and H. Herbelin and D. Herman and D. Keith. A robust implementation of delimited control. Workshop on Theory and Practice of Delimited Continuations, Novi Sad, Servia (TPDC2011).

• P. Downen and Z. M. Ariola. A Systematic Approach to Delimited Control with Multiple Prompts. European Symposium on Programming, Tallinn, Estonia (ESOP2012). Best paper award nominee.

• Z. M. Ariola and P. Downen and H. Herbelin and K. Nakata and A. Saurin. Classical call-by-need sequent calculi: The unity of semantic artifacts. International Symposium on Functional and Logic Programming, Kobe, Japan (FLOPS2012).

Journals:

• Z. M. Ariola and Arvind. Properties of a First-order Functional Language with Sharing. Theoretical Computer Science, Vol. 146, September 1995

• Z. M. Ariola. Relating Graph and Term Rewriting via Böhm Models. Applicable Algebra in Engineering, Communication and Computing, Vol. 7 No 5. 1996.

• Z. M. Ariola and J. W. Klop. Equational Term Graph Rewriting. Fundamentae Informaticae, Vol. 26, Nrs. 3,4, June 1996. p. 207-240. Extended version as University of Oregon Technical Report CIS-TR-95-16.

• Z. M. Ariola, B. C. Massey, M. Sami, E. Tick. A Common Intermediate Language and its Use in Partitioning Concurrent Declarative Languages. New Generation Computing, vol. 14, no. 3, August 1995. (Available as University of Oregon Technical Report CIS-TR-94-05).

• Z. M. Ariola, M. Felleisen. The Call-by-Need Lambda Calculus. Journal of Functional Programming, 7(3):265--301, 1997.

• Z. M. Ariola, J. K. Klop. Lambda calculus with explicit recursion. Journal of Information and Computation, Vol. 139 (2): 154-233, 1997.

• Z. M. Ariola, ,J.K. Klop and Detlef Plump. Bisimilarity in Term Graph Rewriting. Information and Computation 156(1/2):2-24, 2000

• Z. M. Ariola, Stefan Blom. Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic 117/1-3, 97-170, 2002

• Y. Xiao, A. Sabry . Z. M. Ariola, From Syntactic Theories to Interpreters: Automating the proof of unique decomposition. Higher-Order and Symbolic Computation. 14(4), 2001

• Z. M. Ariola, H. Herbelin Amr Sabry . A Type-Theoretic Foundation of Delimited Continuations. In Higher Order and Symbolic Computation. 22(3):233--273, 2009.

• Z. M. Ariola, H. Herbelin Amr Sabry . A Proof-Theoretic Foundation of Abortive Continuations. In Higher Order and Symbolic Computation. 20(4):403-429, 2007.

• Z. M. Ariola, H. Herbelin . Control Reduction Theories: the benefit of structural substitution. Journal of Functional Programming, 18 (3), 373--420, 2008.

• Z. M. Ariola, Aaron Bohannon Amr Sabry. Sequent Calculi and Abstract Machines. In Transactions on Programming Languages. 31(4):1--48, 2009.

Zena M. Ariola