Large Language Model Evaluation on Financial Benchmarks
Bing Zhang, Mikio Takeuchi, et al.
ICAIF 2024
An automatic programming system, THESYS, for constructing recursive LISP programs from examples of what they do is described. The construction methodology is illustrated as a series of transformations from the set of examples to a program satisfying the examples. The transformations consist of (1) deriving the specific computation associated with a specific example, (2) deriving control flow predicates, and (3) deriving an equivalent program specification in the form of recurrence relations. Equivalence between certain recurrence relations and various program schemata is proved. A detailed description of the construction of four programs is presented to illustrate the application of the methodology. © 1977, ACM. All rights reserved.
Bing Zhang, Mikio Takeuchi, et al.
ICAIF 2024
Alex Golts, Daniel Khapun, et al.
MICCAI 2021
Michael Factor, Dafna Sheinwald
Information Sciences
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025