Result 1 to 20 of 42 total
Programs, recursion and unbounded choice. Predicate-transformation semantics and transformation rules. (English)
Cambridge Tracts in Theoretical Computer Science. 27. Cambridge: Univ. Press. XII, 223 p. (1992).
1
Mathematical foundations of computer science. Vol. 1: sets, relations and induction. (English)
Texts and Monographs in Computer Science. New York etc.: Springer-Verlag. X, 425 p. DM 84.00 (1991).
2
Local model checking in the modal mu-calculus. (English)
Theor. Comput. Sci. 89, No.1, 161-177 (1991).
3
On the inference of approximate programs. (English)
Theor. Comput. Sci. 77, No.3, 249-266 (1990).
4
On representation of lexicographic predicates of an arithmetical hierarchy. (Russian)
Diskretn. Mat. 2, No.1, 87-93 (1990).
5
Post’s correspondence problem. A new proof. (English)
Stud. Cercet. Mat. 41, No.4, 225-235 (1989).
6
Mathematics of program construction. 375th anniversary of the Groningen University, international conference, Groningen, Netherlands, June 26-30, 1989. Proceedings. (English)
Lecture Notes in Computer Science. 375. Berlin etc.: Springer-Verlag. VI, 421 p. (1989).
7
Model inference incorporating generalization. (English)
J. Inf. Process. 11, No.3, 206-211 (1988).
8
Inductive syntactical synthesis of programs from sample computations. (English)
Mathematical foundations of computer science, Proc. 13th Symp., Carlsbad/Czech. 1988, Lect. Notes Comput. Sci. 324, 73-84 (1988).
9
Comparing the Church and Turing approaches: Two prophetical messages. (English)
The universal Turing machine, a half-century survey, 603-630 (1988).
10
How to treat decision problems by different programming methodologies. (English)
Mathematical problems in computation theory, Proc. 26th semester, Warsaw/ Poland 1985, Banach Cent. Publ. 21, 169-183 (1988).
11
Positive models and abstract data types. (Russian)
Vychisl. Sist. 122, 47-58 (1987).
12
Logical programming without equality and constructive representations. (Russian)
Vychisl. Sist. 122, 3-18 (1987).
13
Discrete mathematical structures for computer science. 2nd ed. (English)
Englewood Cliffs, NJ: Prentice-Hall, Inc. XV, 464 p. {\$} 35.95 (1987).
14
Types de données et algorithmes. Vol. 2: Recherche, tri, algorithmes sur les graphes. (Data types and algorithms. Vol. 2: Searching, sorting, algorithms on graphs). (French)
Collection Didactique. Rocquencourt (France): INRIA. 240 p. (1987).
15
Theory of lists and its models. (Russian)
Vychisl. Sist. 114, 84-95 (1986).
16
Denotational semantics of the language of $Σ$-expressions. (Russian)
Vychisl. Sist. 114, 16-34 (1986).
17
The language of $Σ$-expressions. (Russian)
Vychisl. Sist. 114, 3-10 (1986).
18
On the expressive power of equality-free first order languages. (English)
Z. Math. Logik Grundlagen Math. 32, 371-375 (1986).
19
Domino-tiling games. (English)
J. Comput. Syst. Sci. 32, 374-392 (1986).
20
Result 1 to 20 of 42 total
Start
Contact
Print
General Help
