Zena M. Ariola
According to our database1, Zena M. Ariola authored at least 51 papers between 1989 and 2020.
Legend:Book In proceedings Article PhD thesis Other
Abstracting models of strong normalization for classical calculi.
J. Log. Algebraic Methods Program., 2020
The Duality of Classical Intersection and Union Types.
Fundam. Inform., 2019
Compiling With Classical Connectives.
Making a faster Curry with extensional types.
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 2019
Codata in Action.
Proceedings of the Programming Languages and Systems, 2019
A tutorial on computational classical logic and the sequent calculus.
J. Funct. Program., 2018
Uniform Strong Normalization for Multi-discipline Calculi.
Proceedings of the Rewriting Logic and Its Applications - 12th International Workshop, 2018
Beyond Polarity: Towards a Multi-Discipline Intermediate Language with Sharing.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018
Call-by-name extensionality and confluence.
J. Funct. Program., 2017
Compiling without continuations.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017
Sequent calculus as a compiler intermediate language.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016
Verification by Way of Refinement: A Case Study in the Use of Coq and TLA in the Design of a Safety Critical System.
Proceedings of the Critical Systems: Formal Methods and Automated Verification, 2016
First Class Call Stacks: Exploring Head Reduction.
Proceedings of the Workshop on Continuations, 2015
Structures for structural recursion.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015
Delimited control and computational effects.
J. Funct. Program., 2014
Continuations, Processes, and Sharing.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014
Compositional semantics for composable continuations: from abortive to delimited control.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014
The Duality of Construction.
Proceedings of the Programming Languages and Systems, 2014
Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts.
Proceedings of the Functional and Logic Programming - 11th International Symposium, 2012
A Systematic Approach to Delimited Control with Multiple Prompts.
Proceedings of the Programming Languages and Systems, 2012
Classical Call-by-Need and Duality.
Proceedings of the Typed Lambda Calculi and Applications - 10th International Conference, 2011
Sequent calculi and abstract machines.
ACM Trans. Program. Lang. Syst., 2009
An overview of the Oregon programming languages summer school.
ACM SIGPLAN Notices, 2009
A type-theoretic foundation of delimited continuations.
High. Order Symb. Comput., 2009
Control reduction theories: the benefit of structural substitution.
J. Funct. Program., 2008
A proof-theoretic foundation of abortive continuations.
High. Order Symb. Comput., 2007
Skew and omega-Skew Confluence and Abstract Böhm Semantics.
Proceedings of the Processes, 2005
A type-theoretic foundation of continuations and prompts.
Proceedings of the Ninth ACM SIGPLAN International Conference on Functional Programming, 2004
Minimal Classical Logic and Control Operators.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003
Skew confluence and the lambda calculus with letrec.
Ann. Pure Appl. Log., 2002
From Syntactic Theories to Interpreters: Automating the Proof of Unique Decomposition.
High. Order Symb. Comput., 2001
Bisimilarity in Term Graph Rewriting.
Inf. Comput., 2000
From Syntactic Theories to Interpreters: A Specification Language and Its Compilation
The Call-By-Need lambda Calculus.
J. Funct. Program., 1997
Lambda Calculus with Explicit Recursion.
Inf. Comput., 1997
Correctness of Monadic State: An Imperative Call-by-Need Calculus.
Electron. Notes Theor. Comput. Sci., 1997
Confluent rewriting of bisimilar term graphs.
Proceedings of the International Workshop on Expressiveness in Concurrency, 1997
Cyclic Lambda Calculi.
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997
Narrowing the Narrowing Space.
Proceedings of the Programming Languages: Implementations, 1997
A Common Intermediate Language and Its Use in Partitioning Concurrent Declarative Programs.
New Gener. Comput., 1996
Equational Term Graph Rewriting.
Fundam. Inform., 1996
Relating graph and term rewriting via Böhm models.
Appl. Algebra Eng. Commun. Comput., 1996
Properties of a First-Order Functional Language with Sharing.
Theor. Comput. Sci., 1995
The Call-by-Need Lambda Calculus.
Proceedings of the Conference Record of POPL'95: 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995
Syntactic Definitions of Undefined: On Defining the Undefined.
Proceedings of the Theoretical Aspects of Computer Software, 1994
Cyclic Lambda Graph Rewriting
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994
Compilation of Concurrent Declarative Languages.
Proceedings of the Integration of Declarative Paradigms, 1994
Order-of-evaluation Analysis for Destructive Updates in Strict Functional Languages with Flat Aggregates.
Proceedings of the conference on Functional programming languages and computer architecture, 1993
A Syntactic Approach to Program Transformations.
Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1991
Compilation of Id.
Proceedings of the Languages and Compilers for Parallel Computing, 1991
P-TAC: A Parallel Intermediate Language.
Proceedings of the fourth international conference on Functional programming languages and computer architecture, 1989