Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
This paper proposes the foundation for a systematic study of the translation of recursive function definitions into flow charts (often called the removal of recursions). Several notions of translation are presented. Emphasis is placed on translation which could be performed mechanically, operating only on the syntactic structure of the recursion equations. Systems of recursion equations are classified by structure and by the dynamics of their implicit computations. A theorem concerned with the relation between iterative form recursion equations and flow charts completes Part I. In Part II a class of systems of recursion equations which are not translatable is exhibited. A restrictive notion of translatability, motivated by a desire for efficient programs as translations, is characterized for a wide (decidable) class. Translation algorithms are presented. © 1971 Academic Press, Inc.
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Frank R. Libsch, Takatoshi Tsujimura
Active Matrix Liquid Crystal Displays Technology and Applications 1997
Imran Nasim, Melanie Weber
SCML 2024
Daniel J. Costello Jr., Pierre R. Chevillat, et al.
ISIT 1997