Result 21 to 29 of 29 total
A decidable case of the semi-unification problem. (English)
Mathematical foundations of computer science, Proc. 16th Int. Symp., Kazimierz Dolny/Pol. 1991, Lect. Notes Comput. Sci. 520, 318-327 (1991).
21
A decidable case of the semi-unification problem (English)
MFCS, 318-327 (1991).
22
Towards kleene algebra with recursion (English)
CSL, 242-256 (1991).
23
Polymorphic recursion and semi-unification. (English)
Börger, E. (ed.) et al., CSL ’89. 3rd Workshop on Computer science logic, Kaiserslautern, Germany, October 2‒6, 1989. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 440, 211-224 (1990).
24
On kilbury’s modification of earley’s algorithm (English)
ACM Trans. Program. Lang. Syst. 12, No. 4, 610-640 (1990).
25
Polymorphic constructs in natural and programming languages (English)
JELIA, 348-365 (1990).
26
Polymorphic recursion and semi-unification (English)
CSL, 211-224 (1989).
27
On type inference for object-oriented programming languages. (English)
Computer science logic, 1st Workshop, Karlsruhe/FRG 1987, Lect. Notes Comput. Sci. 329, 151-172 (1988).
28
On type inference for object-oriented programming languages (English)
CSL, 151-172 (1987).
29
Result 21 to 29 of 29 total
Start
Contact
Print
General Help
