( en | de | ru )

 

Disambiguation of "Ariola, Zena M."

Author of the publication

copydeleteadd this publication to your clipboard
Compiling With Classical Connectives.

, and . Log. Methods Comput. Sci., (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Eva Zena

Khuzama Zena

O Zenaiev

Leying Mabunga Zéna

Asdesach Zena Markos

 

Other publications of authors with the same name

Verification by Way of Refinement: A Case Study in the Use of Coq and TLA in the Design of a Safety Critical System., , and . FMICS-AVoCS, volume 9933 of Lecture Notes in Computer Science, page 205-213. Springer, (2016)Equational Term Graph Rewriting., and . Fundam. Informaticae, 26 (3/4): 207-240 (1996)A Systematic Approach to Delimited Control with Multiple Prompts., and . ESOP, volume 7211 of Lecture Notes in Computer Science, page 234-253. Springer, (2012)Lambda Calculus with Explicit Recursion., and . Inf. Comput., 139 (2): 154-233 (1997)Classical (Co)Recursion: Mechanics., and . CoRR, (2021)Correctness of Monadic State: An Imperative Call-by-Need Calculus., and . HOOTS, volume 10 of Electronic Notes in Theoretical Computer Science, page 53. Elsevier, (1997)A Computational Understanding of Classical (Co)Recursion., and . PPDP, page 5:1-5:13. ACM, (2020)Cyclic Lambda Graph Rewriting, and . LICS, page 416-425. IEEE Computer Society, (1994)Syntactic Definitions of Undefined: On Defining the Undefined., , , , and . TACS, volume 789 of Lecture Notes in Computer Science, page 543-554. Springer, (1994)Cyclic Lambda Calculi., and . TACS, volume 1281 of Lecture Notes in Computer Science, page 77-106. Springer, (1997)