| |
| 2005 | ||
|---|---|---|
| 9 | EE | Olivier Danvy, Mayer Goldberg: There and Back Again. Fundam. Inform. 66(4): 397-413 (2005) |
| 8 | EE | Mayer Goldberg: A Variadic Extension of Curry's Fixed-Point Combinator. Higher-Order and Symbolic Computation 18(3-4): 371-388 (2005) |
| 2004 | ||
| 7 | EE | Mayer Goldberg: A construction of one-point bases in extended lambda calculi. Inf. Process. Lett. 89(6): 281-286 (2004) |
| 2002 | ||
| 6 | EE | Olivier Danvy, Mayer Goldberg: There and back again. ICFP 2002: 230-234 |
| 5 | EE | Mads Sig Ager, Olivier Danvy, Mayer Goldberg: A Symmetric Approach to Compilation and Decompilation. The Essence of Computation 2002: 296-331 |
| 4 | Mayer Goldberg, Mads Torgersen: How to Circumvent Church Numerals. Nord. J. Comput. 9(1): 1-12 (2002) | |
| 2000 | ||
| 3 | EE | Mayer Goldberg: Gödelization in the lambda calculus. Inf. Process. Lett. 75(1-2): 13-16 (2000) |
| 2 | Mayer Goldberg: Theoretical Pearl: An adequate and efficient left-associated binary numeral system in the Lambda-calculus. J. Funct. Program. 10(6): 607-623 (2000) | |
| 1997 | ||
| 1 | Olivier Danvy, Mayer Goldberg: Partial Evaluation of the Euclidian Algorithm. Lisp and Symbolic Computation 10(2): 101-111 (1997) | |
| 1 | Mads Sig Ager | [5] |
| 2 | Olivier Danvy | [1] [5] [6] [9] |
| 3 | Mads Torgersen | [4] |