 |
Литература: Программирование и ремонт Импульсные блоки питания Неисправности и замена Радиоэлектронная аппаратура Микросхема в ТА Рубрикатор ТА Кабельные линии Обмотки и изоляция Радиоаппаратура Гибкие диски часть 2 часть 3 часть 4 часть 5 Ремонт компьютера часть 2 Аналитика: Монтаж Справочник Электроника Мощные высокочастотные транзисторы 200 микросхем Полупроводники ч.1 Часть 2 Алгоритмические проблемы 500 микросхем 500 микросхем Сортировка и поиск Монады Передача сигнала Электроника Прием сигнала Телевидиние Проектирование Эвм Оптимизация Автомобильная электроника Поляковтрансиверы Форт Тензодатчик Силовые полевые транзисторы Распределение частот Резисторные и термопарные Оберон Открытые системы шифрования Удк
[8]
14)Fokkinga, Maarten, Jeuring, Johan, Meertens, Lambert, & Meijer, Erik. (1991). Translating attribute grammars into catamorphisms. The Squiggolist, 2(1).
15)Hutton, Graham. (1998). Fold and unfold for program semantics. Proc. 3rd ACM SIGPLAN International Conference on Functional Programming.
16)Iverson, Kenneth E. (1962). A Programming Language. Wiley, New York.
17)Jansson, Patrick, & Jeuring, Johan. (1998). Polytypic unification. To appear in the Journal of Functional Programming.
18)Jansson, Patrik, & Jeuring, Johan. (1997). PolyP - a polytypic programming language
extension. Proc. 24th ACM SIGPLAN-SIGACT Symposium on Principles of
Programming Languages. ACM Press.
19)Jeuring, Johan. (1995). Polytypic pattern matching. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press, San Diego, California.
20)Jones, Geraint. (1990). Designing circuits by calculation. Technical Report PRG-TR-
10-90. Oxford University.
21)Jones, Geraint, & Sheeran, Mary. (1990). Circuit design in Ruby. Staunstrup (ed), Formal methods for VLSI design. Elsevier Science Publications, Amsterdam. A tutorial on the universality and expressiveness of fold 17.
22)Jones, Mark P., & Blampied, Paul. (1998). A pragmatic approach to maps and folds for parameterized datatypes. Submitted for publication.
23)Kieburtz, Richard B. (1998). Reactive functional programming. Proc. PROCOMET. Chapman and Hall.
24)Kieburtz, Richard B. & Lewis, Jeffrey. (1994). Algebraic Design Language (preliminary definition). Oregon Graduate Institute of Science and Technology.
25)Kleene, S.C. (1952). Introduction to metamathematics. Van Nostrand. Launchbury, John, & Sheard, Tim. (1995). Warm fusion: Deriving build-catas from recursive definitions. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press, San Diego, California.
26)Malcolm, Grant. (1990a). Algebraic data types and program transformation. Ph.D. thesis, Groningen University.
27)Malcolm, Grant. (1990b). Algebraic data types and program transformation. Science of Computer Programming, 14(2-3), 255-280.
28)Meertens, Lambert. 1983 (Nov.). Algorithmics: Towards programming as a mathematical activity. Proc. cwi symposium.
ФП 02005-01 01 | Лист 25 | |||||
№ докум. | ||||||
Копиоова Формат | ||||||
29)Meertens, Lambert. (1992). Paramorphisms. Formal Aspects of Computing, 4(5), 413425.
30)Meijer, Erik. (1992). Calculating compilers. Ph.D. thesis, Nijmegen University.
31)Meijer, Erik, & Hutton, Graham. (1995). Bananas in space: Extending fold and unfold to exponential types. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press, San Diego, California.
32)Meijer, Erik, & Jeuring, Johan. (1995). Merging monads and folds for functional programming. Jeuring, Johan, & Meijer, Erik (eds), Advanced Functional Programming. LCNS, vol. 925. Springer-Verlag.
33)Meijer, Erik, Fokkinga, Maarten, & Paterson, Ross. (1991). Functional programming with bananas, lenses, envelopes and barbed wire. Hughes, John (ed), Proc. Conference on Functional Programming and Computer Architecture. LNCS, no. 523. Springer-Verlag. Peterson, John, et al. . 1997 (Apr.). The Haskell language report, version 1.4. Available on the World-Wide-Web from http: www.haskell.org.
34)Reynolds, John C. (1985). Three approaches to type structure. Proc. International Joint Conference on Theory and Practice of Software Development. Lecture Notes in Computer Science, vol. 185. Springer.
35)Sheard, Tim, & Fegaras, Leonidas. (1993). A fold for all seasons. Proc. ACM Conference on Functional Programming and Computer Architecture. Springer.
36)Swierstra, S. Doaitse, Alcocer, Pablo R. Azero, & Saraiva, Joao. 1998 (Sept.). Designing and implementing combinator languages. Lecture Notes of the 3rd International Summer School on Advanced Functional Programming.
37)Takano, Akihiko, & Meijer, Erik. (1995). Shortcut deforestation in calculational form. Proc. 7th International Conference on Functional Programming and Computer Architecture. ACM Press, San Diego, California.
38)Wadler, Philip. 1981 (Oct.). Applicative style programming, program transformation, and list operators. Proc. ACM Conference on Functional Programming Languages and Computer Architecture.
39)Wadler, Philip. (1990). Comprehending monads. Proc. ACM Conference on Lisp and Functional Programming.
40)Wadler, Philip. (1992a). The essence of functional programming. Proc. Principles of Programming Languages.
41)Wadler, Philip. (1992b). Monads for functional programming. Broy, Manfred (ed), Proc. Marktoberdorf Summer School on Program Design Calculi. Springer-Verlag.
ФП 02005-01 01 | Лист 26 | |||||
№ докум. | ||||||
Копиоова Фоомат | ||||||
Лист регистрации изменений | |||||||||
Номера листов (страниц) | Всего листов (страниц) в докум. | документа | Входящий № сопроводительного докум. и дата | ||||||
изменённых | заменённых | аннулирован-ных | |||||||