论文信息 - On effective computations of nondeterministic schemes - 字舞流文

On effective computations of nondeterministic schemes

[1] José Meseguer,et al. On Order-Complete Universal Algebra and Enriched Functorial Semantics , 1977, FCT.

[2] Eduardo J. Dubuc,et al. Kan Extensions in Enriched Category Theory , 1970 .

[3] Axel Poigné. An Order Semantics for Non-Deterministic Recursive Program Schemes , 1981, GI Jahrestagung.

[4] Matthew Hennessy,et al. Full Abstraction for a Simple Parallel Programming Language , 1979, MFCS.

[5] Maurice Nivat. Non Deterministic Programs: An Algebraic Overview , 1980, IFIP Congress.

[6] Maurice Nivat,et al. Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs , 1980, Theor. Comput. Sci..

[7] Axel Poigné. Using Last Fixed Points to Characterize Formal Computations of Non-Deterministic Equations , 1981, ICFPC.

[8] José Meseguer,et al. Order completion monads , 1983 .

[9] I. Ramos,et al. Formalization of Programming Concepts , 1981, Lecture Notes in Computer Science.