Search the dblp DataBase
Zena M. Ariola :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Zena M. Ariola , Stefan Blom Skew and omega -Skew Confluence and Abstract Böhm Semantics. [Citation Graph (0, 0)][DBLP ] Processes, Terms and Cycles, 2005, pp:368-403 [Conf ] Zena M. Ariola , Arvind P-TAC: A Parallel Intermediate Language. [Citation Graph (0, 0)][DBLP ] FPCA, 1989, pp:230-242 [Conf ] A. V. S. Sastry , William D. Clinger , Zena M. Ariola Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates. [Citation Graph (0, 0)][DBLP ] FPCA, 1993, pp:266-275 [Conf ] Zena M. Ariola , Hugo Herbelin Minimal Classical Logic and Control Operators. [Citation Graph (0, 0)][DBLP ] ICALP, 2003, pp:871-885 [Conf ] Zena M. Ariola , Hugo Herbelin , Amr Sabry A type-theoretic foundation of continuations and prompts. [Citation Graph (0, 0)][DBLP ] ICFP, 2004, pp:40-53 [Conf ] Zena M. Ariola , Barton C. Massey , M. Sami , Evan Tick Compilation of Concurrent Declarative Languages. [Citation Graph (0, 0)][DBLP ] ICLP Workshop: Integration of Declarative Paradigms, 1994, pp:120-134 [Conf ] Zena M. Ariola , Arvind Compilation of Id. [Citation Graph (0, 0)][DBLP ] LCPC, 1991, pp:99-121 [Conf ] Zena M. Ariola , Jan Willem Klop Cyclic Lambda Graph Rewriting [Citation Graph (0, 0)][DBLP ] LICS, 1994, pp:416-425 [Conf ] Zena M. Ariola , Arvind A Syntactic Approach to Program Transformations. [Citation Graph (0, 0)][DBLP ] PEPM, 1991, pp:116-129 [Conf ] Sergio Antoy , Zena M. Ariola Narrowing the Narrowing Space. [Citation Graph (0, 0)][DBLP ] PLILP, 1997, pp:1-15 [Conf ] Zena M. Ariola , Matthias Felleisen , John Maraist , Martin Odersky , Philip Wadler The Call-by-Need Lambda Calculus. [Citation Graph (0, 0)][DBLP ] POPL, 1995, pp:233-246 [Conf ] Zena M. Ariola , Amr Sabry Correctness of Monadic State: An Imperative Call-by-Need Calculus. [Citation Graph (0, 0)][DBLP ] POPL, 1998, pp:62-74 [Conf ] Zena M. Ariola Relating Graph and Term Rewriting via Böhm Models. [Citation Graph (0, 0)][DBLP ] RTA, 1993, pp:183-197 [Conf ] Zena M. Ariola , Stefan Blom Cyclic Lambda Calculi. [Citation Graph (0, 0)][DBLP ] TACS, 1997, pp:77-106 [Conf ] Zena M. Ariola , Richard Kennaway , Jan Willem Klop , M. Ronan Sleep , Fer-Jan de Vries Syntactic Definitions of Undefined: On Defining the Undefined. [Citation Graph (0, 0)][DBLP ] TACS, 1994, pp:543-554 [Conf ] Zena M. Ariola Relating Graph and Term Rewriting via Böhm Models. [Citation Graph (0, 0)][DBLP ] Appl. Algebra Eng. Commun. Comput., 1996, v:7, n:5, pp:401-426 [Journal ] Zena M. Ariola , Stefan Blom Skew confluence and the lambda calculus with letrec. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2002, v:117, n:1-3, pp:95-168 [Journal ] Yong Xiao , Zena M. Ariola , Michel Mauny From Syntactic Theories to Interpreters: A Specification Language and Its Compilation [Citation Graph (0, 0)][DBLP ] CoRR, 2000, v:0, n:, pp:- [Journal ] Zena M. Ariola , Jan Willem Klop , Detlef Plump Confluent rewriting of bisimilar term graphs. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:7, n:, pp:- [Journal ] Zena M. Ariola , Amr Sabry Correctness of Monadic State: An Imperative Call-by-Need Calculus. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal ] Zena M. Ariola , Jan Willem Klop Equational Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 1996, v:26, n:3/4, pp:207-240 [Journal ] Zena M. Ariola , Jan Willem Klop , Detlef Plump Bisimilarity in Term Graph Rewriting. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2000, v:156, n:1-2, pp:2-24 [Journal ] Zena M. Ariola , Jan Willem Klop Lambda Calculus with Explicit Recursion. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1997, v:139, n:2, pp:154-233 [Journal ] Zena M. Ariola , Matthias Felleisen The Call-By-Need lambda Calculus. [Citation Graph (0, 0)][DBLP ] J. Funct. Program., 1997, v:7, n:3, pp:265-301 [Journal ] Yong Xiao , Amr Sabry , Zena M. Ariola From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition. [Citation Graph (0, 0)][DBLP ] Higher-Order and Symbolic Computation, 2001, v:14, n:4, pp:387-409 [Journal ] Zena M. Ariola , Barton C. Massey , M. Sami , Evan Tick A Common Intermediate Language and Its Use in Partitioning Concurrent Declarative Programs. [Citation Graph (0, 0)][DBLP ] New Generation Comput., 1996, v:14, n:3, pp:281-315 [Journal ] Zena M. Ariola , Arvind Properties of a First-Order Functional Language with Sharing. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1995, v:146, n:1&2, pp:69-108 [Journal ] Search in 0.003secs, Finished in 0.004secs