S. M. Abramov, R. Gluck. Principles of inverse computation and the universal resolving algorithm. In T. . Mogensen, D. Schmidt, I. H. Sudborough (eds.), The Essence of Computation: Complexity, Analysis, Transformation, LNCS 2566, 269--295. Springer-Verlag, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
A Program Inverter for a Functional Language with Equality and .. - Glück, Kawabe (2003) Self-citation (Gluck) (Correct)
No context found.
S. M. Abramov, R. Gluck. Principles of inverse computation and the universal resolving algorithm. In T. . Mogensen, D. Schmidt, I. H. Sudborough (eds.), The Essence of Computation: Complexity, Analysis, Transformation, LNCS 2566, 269--295. Springer-Verlag, 2002.
Combinators for Bi-Directional Tree.. - Foster.. (2004) (2 citations) (Correct)
No context found.
S. M. Abramov and R. Gluck. Principles of inverse computation and the universal resolving algorithm. In T. Mogensen, D. Schmidt, and I. H. Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation, volume 2566 of Lecture Notes in Computer Science, pages 269--295. SpringerVerlag, 2002.
Transforming Interpreters into Inverse Interpreters by.. - Glück, Kawada, al. (2003) (Correct)
No context found.
S. M. Abramov and R. Gluck. Principles of inverse computation and the universal resolving algorithm. In T. . Mogensen, D. Schmidt, and I. H. Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation, LNCS 2566, pages 269--295. Springer-Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC