Partial Evaluation of the Euclidian Algorithm. - Olivier Danvy; Mayer Goldberg (LISP Symb. Comput., 1997)

Gödelization in the lambda calculus. - Mayer Goldberg (Inf. Process. Lett., 2000)

Theoretical Pearl: An adequate and efficient left-associated binary numeral system in the Lambda-calculus. - Mayer Goldberg (J. Funct. Program., 2000)

A Symmetric Approach to Compilation and Decompilation. - Mads Sig Ager; Olivier Danvy; Mayer Goldberg (The Essence of Computation, 2002)

There and back again. - Olivier Danvy; Mayer Goldberg (ICFP, 2002)

How to Circumvent Church Numerals. - Mayer Goldberg; Mads Torgersen (Nord. J. Comput., 2002)

A construction of one-point bases in extended lambda calculi. - Mayer Goldberg (Inf. Process. Lett., 2004)

A Variadic Extension of Curry's Fixed-Point Combinator. - Mayer Goldberg (High. Order Symb. Comput., 2005)

Generating Flexible Code for Associations. - Mayer Goldberg; Guy Wiener (ENASE, 2010)

Generating Code for Associations Supporting Operations on Multiple Instances. - Mayer Goldberg; Guy Wiener (ENASE (Selected Papers), 2010)

Round-Trip Modeling Using OPM/PL. - Mayer Goldberg; Guy Wiener (SwSTE, 2010)

A Declarative Approach for Software Modeling. - Mayer Goldberg; Guy Wiener (PADL, 2012)

Ellipses and Lambda Definability. - Mayer Goldberg (Log. Methods Comput. Sci., 2015)

A Spigot-Algorithm for Square-Roots: Explained and Extended. - Mayer Goldberg (CoRR, 2023)