Εμφανίζονται 1 - 20 Αποτελέσματα από 48 για την αναζήτηση '"ФУНКЦИОНАЛЬНАЯ ЭКВИВАЛЕНТНОСТЬ"', χρόνος αναζήτησης: 0,64δλ Περιορισμός αποτελεσμάτων
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
    Academic Journal

    Πηγή: Modeling and Analysis of Information Systems; Том 25, № 5 (2018); 549-560 ; Моделирование и анализ информационных систем; Том 25, № 5 (2018); 549-560 ; 2313-5417 ; 1818-1015

    Περιγραφή αρχείου: application/pdf

    Relation: https://www.mais-journal.ru/jour/article/view/756/571; Olver P. J., Applications of Lie groups to differential equations, Springer-Verlag, New York, 1993.; Bellman R., “The theory of dynamic programming”, Bulletin of the American Mathematical Society, 60 (1954), 503-516.; Berry G., “Bottom-up computation of recursive programs”, RAIRO — Informatique Theorique et Applications (Theoretical Informatics and Applications), 10:3 (1976), 47¬82.; Cowles J., Computer-Aided reasoning: ACL2 case studies, Kluwer Academic Publishers, 2000.; Cowles J., Gamboa R., “Contributions to the Theory of Tail Recursive Functions”, 2004, http://www.cs.uwyo.edu/~ruben/static/pdf/tailrec.pdf, accessed September 26, 2018.; Cormen T. H. et al., Introduction to Algorithms (3rd ed.), The MIT Press, 2009.; De Moor O., Sittampalam G., “Generic Program Transformation”, Lecture Notes in Computer Science, 1608, 1999, 116-149.; Ershov A.P., “Mixed computation: potential applications and problems for study”, Theor. Comp. Sci., 18:1 (1982), 41-67.; Greibach S. A., Theory of Program Structures: Schemes, Semantics, Verification, Lecture Notes in Computer Science, 36, Springer, 1975.; Jones N. D. et al., Partial Evaluation and Automatic Program Generation, Prentice Hall International, 1993.; KnuthD.E., Textbook Examples of Recursion, 1991, arXiv:cs/9301113[cs.CC], accessed September 26, 2018.; Kotov V. E., Sabelfeld V. K., Theoriya Schem Programm, Nauka, 1991.; Liu Y. A., Stoller S.D., “Program optimization using indexed and recursive data structures”, Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program, manipulation, 2002, 108-118.; Liu Y. A., Systematic Program Design: From Clarity to Efficiency, Cambridge University Press, 2013.; Manna Z., Pnueli A., “Formalization of Properties of Functional Programs”, Journal of the ACM, 17:3 (1970), 555-569.; Manna Z., McCarthy J., “Properties of programs and partial function logic”, Machine Intelligence, 5 (1970), 79-98.; Paterson M.S., Hewitt C.T., “Comperative Schematology”, Proc. of the ACM Conf. on Concurrent Systems and Parallel Computation, 1970, 119-127.; Shilov N.V., “Unifying Dynamic Programming Design Patterns”, Bulletin of the Novosibirsk Computing Center (Series: Computer Science), 34 (2012), 135-156.; Shilov N. V., “Algorithm Design Patterns: Program Theory Perspective”, Proc. of Fifth Int. Valentin Turchin Workshop on Metacomputation (META-2016), 2016, 170-181.; Wand M., “Continuation-Based Program Transformation Strategies”, Journal of the ACM, 27:1 (1980), 164-180.; “McCarthy 91 function”, https://en.wikipedia.org/wiki/McCarthy_91_function, accessed September 26, 2018.

  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20