Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Ariola, Zena M. - Department of Computer and Information Science, University of Oregon
Orderofevaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates
Lambda Calculi plus Letrec Zena M. Ariola
Relating Graph and Term Rewriting via Bohm Zena M. Ariola
Equational Term Graph Rewriting Zena M. Ariola Jan Willem Klop
A TypeTheoretic Foundation of Continuations and Prompts
A Syntactic Approach to Program Transformations Zena M. Ariola
Compilation of Concurrent Declarative Z. M. Ariola, B. C. Massey, M. Sami, and E. Tick
Cyclic Lambda Calculi Zena M. Ariola 1 and Stefan Blom 2
A Proof-Theoretic Foundation of Abortive Continuations
J. Functional Programming 1 (1): 1--000, January 1993 c fl Cambridge University Press 1
Sequent Calculi and Abstract Machines ZENA M. ARIOLA
Relating Graph and Term Rewriting via Bohm Models Zena M. Ariola
Correctness of Monadic State: An Imperative CallbyNeed Calculus
Equational Term Graph Rewriting Zena M. Ariola
Bisimilarity in Term Graph Rewriting \Lambda Zena M. Ariola
A TypeTheoretic Foundation of Delimited Continuations +
Lambda Calculus with Explicit Recursion Zena M. Ariola
Narrowing the Narrowing Space ? Sergio Antoy 1 and Zena M. Ariola 2
Properties of a Firstorder Functional Language with Sharing Zena M. Ariola
A CallByNeed Lambda Calculus Zena M. Ariola
Graph Rewriting Systems For Efficient Compilation
Cyclic Lambda Graph Rewriting Zena M. Ariola Jan Willem Klop
Minimal Classical Logic and Control Operators Zena M. Ariola 1 and Hugo Herbelin 2
