Alexander Romanenko
- Abramov 88 S.M.Abramov. Memcomputation m~d Logic Progrmnruing. In Semiotic aspects offormalization of the intellectual activity, All-union school-workshop "Borjomi-88", Moscow, 1988.(In Russi,oa0.Google Scholar
- Abramov 89 S.M.Abramov. Metacalculations and Logical Programming, 1989, Unpublished.Google Scholar
- Cutland 80 N.Cutland. COMPUTABILITY. An introduction to recursive function theory, Cambridge University Press, 1980.Google ScholarCross Ref
- Debray 89 S.K.Debray. Static Inference of Modes and Data Dependencies in Logic Programs. In ACM TOPLAS, Vol. 11,No.3, July 1989,418-450. Google ScholarDigital Library
- Debray, Warren 89 S.K.Debray, D.S.Warren. Functional Computations in Logic Programs. In A CM TOPLA& Vol.11,No.3, July 1989,451-481. Google ScholarDigital Library
- Fuller, Abramsky 88 D.A.Fuller, S.Abramsky. Mixed Computation of Prolog Program. In New Generation Computing, 6(1988) 119- 141. Google ScholarDigital Library
- Futamura 71 Y.Futamura. Partial Evaluation of Computation Processan Approach to a Compiler-Compiler. In Systerms, Computers, Control. Vol. 2, No. 5, 1971, pp.45-50.Google Scholar
- Glueck Turchin 90 R.Glueck, V.Turchin. Application of Metasystem Transition to Function Inversion and Transformation. In Proceedings of international Sympositott on Symbolic and Algebraic Computation (ISSAC'90), 1990. Google ScholarDigital Library
- Gris 81 D.Gris. The Science of Progrm~maing. Springer-Verlag, 1981. Google ScholarDigital Library
- Harrison 88 P.G.Harrison. Function Inversion. In {Jones, Bjomer,Er-shov 88}, pp.153-166.Google Scholar
- Hughes,O’Donnell 89 J.Hughes, J. O'Donnell. Expression and Reasoning About Non-deterministic Functional Prognuns. In Functional Prograntming. K.Davis, J.Hughes - eds. Glasgo, 1989, pp. 308-328. Google ScholarDigital Library
- Jones,Bjorner,Ershov 88 Proceedings of the Workshop on Partial Erahtation and Mixed Computation. N.Jones, D.Bjorner, A.Ershov - eds. Gammel Avernaes, Denmark, 18-24 October 1987, Norris-Holland, 1988.Google Scholar
- Jones 88 Autc)matic Programml Specializatiow a Reexuunination from Basic Principles. In {Jones,Bjomer, Ershov 88}, pp.225-282.Google Scholar
- Kursawe 88 Pure Partial Evaluation and Instantiation. In {Jones, Bjorner,Ershov 88}, pp.283-298.Google Scholar
- McCarthy 56 J.McCarthy. The Inversion of Functions defined by Turing Machines. In Automata Studies. C.E.Shannon, J.Mc- Carthy - eds. Princeton, 1956. pp.177-181.Google Scholar
- Reddy 84 U.S.Reddy. Tnmsfonnation of Logic Programs into Functional Progrmns. In Intern. Syrup. Logic Prog., IEEE, 1984, pp.187-197.Google Scholar
- Reddy 86 U.S.Reddy. Logic Languages based on Functions: Semantics and hnplemenu~tion. Technical Report I.IIUC- DCS-R-86-1305, Illinois, 1986, Ph.D.thesis done at 11niv. Google ScholarDigital Library
- Reddy87 U.S.Reddy. Functioned logic lmlguages, Part 1. - In Graph Reduction, Springer-Verlag, 1987, pp.401-425. (LNCS, Vol. 279) Google ScholarDigital Library
- Romanenko A. 88 A.Y.Romanenko. The Generation of Inverse Functions in Ref',d. in {Jones,Bjomer,Ershov 88}, pp 427-444.Google Scholar
- Runciman,Jagger 90 C.Runciman,N lao-er Relative Specification m~d Translbnnaticmal Re-use of Functional Programs. In Lisp arid Symbolic Conq)ntation An international Journal, 3,199(), pp.21-37. Google ScholarDigital Library
- Shoman, McDermott 84 Y.Shomzm,D.V.McDem~ott. Directed Relations ,'rod Inversic)n ~f Prolog Progr,'uns.- in Proceedings o.l'the International Conference of F(fih Generation Computer Syst enls. IC()T, 1984.Google Scholar
- Slagle 74 J Slaole Automated Theorem-Proving f{~r theories wifll simplifiers, commutativity ,'rod ~vssciativity. in .IACM, Vc)l. 21, Nc), 4, Oct.1974, pp.622-642. Google ScholarDigital Library
- Turchin 72 V.F.Turchin. Equiv~dent Transformations of Recursive Function,,, defined in REFAL. - in Teoria yaz.ykov i nletody l?OSt;'r)enia system programiro~4'ania. Trudy sympos. Kiev-Alushla, 1972,pp.31-42.(In Russiml)Google Scholar
- Turchin 74 V.F.Turchin. Equivalent Transformations of Programs in REFAL. CNIPIASS, Gosstroy SSSR, Moscow, 1974 (in Russian)Google Scholar
- Turchin 79 Turchin,V.F.,Supercompiler System Based on the Language REFAL. - SIGPLAN Notices, 14(2), 1979, pp.46- 54. Google ScholarDigital Library
- Turchin 80 V.F.Turchin. The Language Refal. The Theory of Compilation and Metasystem Analysis. Curant Institute of Mathematics. Technical report #018, NY, 1980.Google Scholar
- Turchin 86 V.F.Turchin. The Concept of a Supercompiler. In A CM TOPLAS, Vol.8, No. 3, 1986, pp 292-325. Google ScholarDigital Library
- Turchin 87 V.F.Turchin. A Constructive Interpretation of the Full Set Theory. in The Journal of Symbolic Logic, Vol. 52, No 1, March 1987, pp.172-201.Google Scholar
- Turchin 88 V.F.Turchin. The Algorithm of Generalization in the Supercompiler. In {Jones,Bjorner,Ershov 88}, pp 531-549.Google Scholar
- Turchin 89 V.F.Turchin. REFAL-5. Progrmmning Guide and Reference Manual. Refal Systems Inc., 1989.Google Scholar
- Turchin 90 V.F.Turchin. The supercompiler system. 1990. Unpublished.Google Scholar
Index Terms
- Inversion and metacomputation
Recommendations
Fast Inversion in ${\schmi{GF(2^m)}}$ with Normal Basis Using Hybrid-Double Multipliers
Fast inversion in finite fields is crucial for high-performance cryptography and codes. We present techniques to exploit the recently proposed hybrid-double multipliers for fast inversions in binary fields $GF(2^m)$ with normal bases. A hybrid-double ...
Finding an Optimal Inversion Median: Experimental Results
WABI '01: Proceedings of the First International Workshop on Algorithms in BioinformaticsWe derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree using simple geometric properties of the problem and a newly available linear-...
Reducing Risk Through Inversion and Self-Strengthening
A number of new techniques for reliability improvement and risk reduction based on the inversion method, such as: 'inverting design variables,' 'inverting by maintaining an invariant,' 'inverting resulting in a reinforcing counter-force,' 'negating ...
Comments