Parents
Sign in to add mentor| Patrick C. Fischer | grad student | 1972 | Harvard (MathTree) | |
| (On Complex Recursive Functions) | ||||
Children
Sign in to add trainee| Leonid A. Levin | grad student | ||
| John Mitchell | grad student | ||
| Nancy A. Lynch | grad student | 1972 | MIT (EduTree) |
| Jeanne Ferrante | grad student | 1974 | MIT (E-Tree) |
| Joseph Halpern | grad student | 1981 | Harvard |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Stockmeyer L, Meyer AR. (2002) Cosmological lower bound on the circuit complexity of a small problem in logic Journal of the Acm. 49: 753-784 |
| Bloom B, Istrail S, Meyer AR. (1995) Bisimulation can't be traced Journal of the Acm. 42: 232-268 |
| Bruce KB, Meyer AR, Mitchell JC. (1990) The semantics of second-order lambda calculus Information & Computation. 85: 76-134 |
| Halpern JY, Loui MC, Meyer AR, et al. (1986) On time versus space III Mathematical Systems Theory. 19: 13-28 |
| Parikh R, Chandra AK, Halpern JY, et al. (1985) Equations between Regular Terms and an Application to Process Logic Siam Journal On Computing. 14: 935-942 |
| Meyer AR, Tiuryn J. (1984) Equivalences among logics of programs Journal of Computer and System Sciences. 29: 160-170 |
| Meyer AR, Mitchell JC. (1983) Termination assertions for recursive programs: Completeness and axiomatic definability Information and Control. 56: 112-138 |
| Meyer AR, Halpern JY. (1982) Axiomatic Definitions of Programming Languages: A Theoretical Assessment Journal of the Acm. 29: 555-576 |
| Greif I, Meyer AR. (1981) Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer Acm Transactions On Programming Languages and Systems. 3: 484-507 |
| Bruss AR, Meyer AR. (1980) On time-space classes and their relation to the theory of real addition Theoretical Computer Science. 11: 59-69 |