ÿþ<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD> <META http-equiv=Content-Type content="text/html; charset=unicode"> </HEAD> <DIV STYLE="position:relative; left:10; width:600"> <BODY BACKGROUND="konyv.gif"> <center><h3>Résumé of Dr. György E. Révész</h3></center> <h4>Education</h4> Ph. D. in Mathematics, Eötvös Lóránd University of Budapest, 1968 <h4>Areas of specialization</h4> Formal Languages and Automata Theory, Semantics of Programming Languages, Compiler Design, Lambda-Calculus and Functional Programming, Numerical Methods, Parallel Computing, Cryptography. <h4>Courses taught in the last 5 years</h4> Survey of Programming Languages <BR>Compiler Design <BR>Introductio to Coding Theory <BR>Foundations of Cryptography <BR>Formal Languages and Automata Theory <BR>Switching and Automata Theory <BR>Theory of Computation <BR>Numerical Methods <BR>Data Structures <h4>Employment history</h4> <BR>Professor Emeritus, 2001 - <BR>Department of Computer Science <BR>University of North Carolina at Charlotte <BR> <BR>Visiting Professor, Fall of 2001 <BR>Department of Computer Science and Engineering, <BR>University of Nebraska at Lincoln <BR> <BR>Professor, 1991 - 2000 (Department Chair 1991 - 1994) <BR>Department of Computer Science <BR>University of North Carolina at Charlotte <BR> <BR>Research Staff Member, 1985 - 1991 <BR>IBM T. J. Watson Research Center <BR>Yorktown Heights, N.Y. <BR> <BR>Professor, 1982 - 1985 <BR>Department of Computer Science <BR>Tulane University, New Orleans, LA <BR> <BR>Visiting Associate Professor, 1980 -1982 <BR>Department of Computer Science, <BR>University of Kentucky, Lexington, KY <BR> <BR>Senior Research Staff Member, 1974 - 1980 <BR>Computer and Automation Institute of the Hungarian Academy of Sciences <BR>Budapest, Hungary <BR> <BR>Visiting Associate Professor, 1977 - 1978 <BR>Department of Computer Science <BR>Virginia Polytechnic Institute and State University, Blacksburg, VA <BR> <BR>Department Head, 1971 - 1974 <BR>Systems Software Department <BR>Institute for Coordination of Computer Techniques, Budapest, Hungary <BR> <BR>Department Head, 1969 - 1971 <BR>Information Processing Laboratory <BR>Central Bureau of Statistics, Budapest, Hungary <BR> <BR>Chief Programmer, 1964 - 1969 <BR>Electronic Data Processing Center <BR>National Bank of Hungary, Budapest, Hungary <BR> <BR>Research Assistant, 1956 - 1964 <BR>Department of Mathematics <BR>Eötvös Lóránd University, Budapest, Hungary <h4>Grants and Fellowships</h4> Principal Investigator of the research project "Lambda-calculus-based semantics of applicative languages", NSF Grant No.: MCS-8304819, 1983 - 1985. <p> IREX fellowship for 6 months working as a visiting scientist at the University of California at Berkeley and at the University of Southern California, Los Angeles, 1975/76. </p> <p> IBM ROECE grant for a 5 month training as an IBM instructor in Austria and Germany , 1969. </p> <p> UNESCO fellowship for 3 months working as a visiting scientist at the University of Bonn, Germany, and at the Technische Hochschule, Darmstadt, Germany, 1961/62. </p> <h4>Selected publications</h4> <h4><i><u>Books</u></i></h4> <p> <i>Introduction to Formal Languages, </i> McGraw-Hill Computer Science Series, 1983. (Reprinted by DOVER Publications, Inc., New York, 1991.) </p> <p> <i>Lambda-Calculus, Combinators, and Functional Programming, </i> Cambridge Tracts in Theoretical Computer Science <b>4</b>, Cambridge University Press, 1988. <h4><i><u>Refereed Journal Papers</u></i></h4> Experimenting with Tail Recursion and Simulating Coroutines, <i>SIGACT Bulletin,</i> December 1998, pp. 51a-54a. <p> Categorical Combinators with Explicit Products, <i>Fundamenta Informaticae,</i> special issue on "Categories in Computer Science", Vol. <b>22</b>, No. 1,2 (Jan. - Feb. 1995), pp. 153-166. <p> A list oriented extension of the lambda-calculus satisfying the Church - Rosser theorem, <i>Theoretical Computer Science,</i> Vol. <b>93</b>, issue 1, (February 1992), pp. 75-89. <p> On translating ordinary mathematical notation, <i>Structured Programming,</i> Vol. 12, No. 3, (September 1991), pp. 115-122. <p> Comparing two functional programming systems, (with B. Hailpern and T. Huynh), <i>IEEE Transactions on Software Engineering,</i> Vol. 15, No. 5, (May 1989), pp. 532-542. <p> Axioms for the theory of lambda-conversion, <i>SIAM Journal on Computing,</i> Vol. 14, No. 2, (May 1985), pp. 373 - 382. <p> A note on macro generation, <i>Software - Practice and Experience,</i> Vol. 15, No. 5, (May 1985), pp. 423-426. <p> An extension of the lambda-calculus for functional programming, <i>Journal of Logic Programming,</i> Vol. 1, No. 3, (October 1984), pp. 241-251. <p> An efficient procedure for finding normal forms of lambda-terms, (with M. Soós) <i>SMIL Journal of Linguistic Calculus,</i> 1980, No. 3, pp. 51-62. <p> Algebraic properties of derivation words, <i>Journal of Computer and System Sciences,</i> Vol 15, No. 2, (1977) pp. 232-240. <p> Multicontrol Turing machines, <i>Acta Cybernetica,</i> Tom. 3, Fasc. 2 (1977), pp. 173-177. <p> A note on the relation of Turing machines to phrase structure grammars, <i>Computational Linguistics and Computer Languages,</i> Vol. XI (1976), pp. 11-16. <p> On phrase structure grammars and two-pushdown automata (in Hungarian), <i>Alkalmazott Matematikai Lapok,</i> Vol. 1, No. 3-4 (1975), pp. 397-404. <p> Comment on the paper 'Error detection in formal languages', <i>Journal of Computer and System Sciences,</i> Vol. 8, No. 2 (1974), pp. 238-242. <p> Dual pushdown automata and context-sensitive grammars, <i>Acta Cybernetica,</i> Tom. 1, Fasc. 3, (1972), pp. 147-151. <p> Unilateral context-sensitive grammars and left-to-right parsing, <i>Journal of Computer and System Sciences,</i> Vol. 5, No. 4, (August 1971), pp. 337-352. <p> Parsing from left to right and structural properties of certain formal languages, <i>Computational Linguistics and Computer Languages,</i> Vol. VII. (1971), pp. 11-16. <p> Syntactic analysis and unilateral context-sensitive grammars, <i>Studia Scientiarum Mathematicarum Hungarica,</i> Vol. 4 (1969), pp. 267-278. <p> An efficient syntactic analyzer of certain formal languages, <i>Mathematical Systems Theory,</i> Vol. 2, No. 2, (June 1968), pp. 147-158. <p> Über ein Zuschnittproblem mit vielen Veränderlichen, <i>Mathematik und Wirtschaft,</i> Band. III (1966), pp. 425-465. <p> On the polynomial approximation of the exponential function (in Hungarian), <i>Matematikai Lapok,</i> Vol. XII, No. 3-4 (1961), pp. 221-231. <h4><i><u>Conference Papers</u></i></h4> <p> Categorical Combinators with explicit products, <i>7th International Conference on Automata and Formal Languages,</i> Salgótarján, Hungary, 1993. <p> Parallel graph-reduction with a shared-memory multiprocessor system, <i>Proc. IEEE 1990 International Conference on Computer Languages,</i> New Orleans, (May 12-18), pp. 33-38. <p> Rule-based semantics for an extended lambda-calculus, <i>Mathematical Foundations of Programming Language Semantics,</i> (Ed. M. Main et al.), Lecture Notes in Computer Science Vol. 298, Springer Verlag 1988, pp. 43-56. <p> Algebraic properties of derivation words, <i>Les arbres en algèbre et en programmation - 2. Coll.</i> , Lille (1977), pp. 224-234. <p> Über Experimente der automatischen Programmierung auf der Maschine M-3 im Rechenzentrum der Ungarischen Akademie der Wissenschaften, <i>Proc. Colloquium on the Foundations of Mathematics, Mathematical Machines and their Applications,</i> Tihany (Sept. 1962), Akadémiai Kiadó, Budapest, 1965, pp. 239-244. </FONT> </BODY> </DIV> </HTML>