Maple: a Programming Language, Operating System. - Paul J. Voda (POPL, 1982)

RF-Maple: A Logic Programming Language with Functions, Types, and Concurrency. - Paul J. Voda; Benjamin Yu (FGCS, 1984)

A View of Programming Languages as Symbiosis of Meaning and Computations. - Paul J. Voda (New Gener. Comput., 1985)

Choices in, and Limitations of, Logic Programming. - Paul J. Voda (ICLP, 1986)

Computation of Full Logic Programs Using One-Variable Environments. - Paul J. Voda (New Gener. Comput., 1986)

Types of Trilogy. - Paul J. Voda (ICLP/SLP, 1988)

The Logical Reconstruction of Cuts as One Solution Operators. - Paul J. Voda (META, 1988)

Subrecursion as a Basis for a Feasible Programming Language. - Paul J. Voda (CSL, 1994)

Syntactic Reduction of Predicate Tableaux to Propositional Tableaux. - Ján Komara; Paul J. Voda (TABLEAUX, 1995)

A Simple Ordinal Recursive Normalization of Gödel's T. - Paul J. Voda (CSL, 1997)

On Quasitautologies. - Ján Komara; Paul J. Voda (TABLEAUX, 1997)

Theorems af Péter and Parsons in Computer Programming. - Ján Komara; Paul J. Voda (CSL, 1998)

Computer Programming as Mathematics in a Programming Language and Proof System CL. - Ján Komara; Paul J. Voda (TABLEAUX, 1998)

The Surprising Power of Restricted Programs and Gödel's Functionals. - Lars Kristiansen; Paul J. Voda (CSL, 2003)

Complexity classes and fragments of C. - Lars Kristiansen; Paul J. Voda (Inf. Process. Lett., 2003)

Programming Languages Capturing Complexity Classes. - Lars Kristiansen; Paul J. Voda (Nord. J. Comput., 2005)

The Trade-Off Theorem and Fragments of Gödel's T. - Lars Kristiansen; Paul J. Voda (TAMC, 2006)

The Structure of Detour Degrees. - Lars Kristiansen; Paul J. Voda (TAMC, 2008)

First- and Second-Order Models of Recursive Arithmetics. - Ján Kluka; Paul J. Voda (CoRR, 2017)

On Herbrand Skeletons. - Paul J. Voda; Ján Komara (CoRR, 2019)

Extraction of Efficient Programs in IΣ1-arithmetic. - Ján Komara; Paul J. Voda (CoRR, 2019)