( en | de | ru )

 

Disambiguation of "Sabelfeld, Viktor K."

Author of the publication

copydeleteadd this publication to your clipboard
Simple Semantic Analysis Problems for Functional Programs.

, and . ICFP, page 319. ACM, (1997)SIGPLAN Notices 32(8), August 1997.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Viktor K ressaar

Aman K K Bhasin

K Böhm

K Schweizerhof

K Schaber

 

Other publications of authors with the same name

Tree Equivalence of Linear Recursive Schemata is Polynomial-Time Decidable.. Inf. Process. Lett., 13 (4/5): 147-153 (1981)The Logic-Termal Equivalence is Polynomial-Time Decidable.. Inf. Process. Lett., 10 (2): 57-62 (1980)Procedure implementation in a multi-language translator.. Methods of Algorithmic Language Implementation, volume 47 of Lecture Notes in Computer Science, page 80-89. Springer, (1975)Simple Semantic Analysis Problems for Functional Programs., and . ICFP, page 319. ACM, (1997)SIGPLAN Notices 32(8), August 1997.The Tree Equivalence Problem for Linear Recursion Schemes.. Ershov Memorial Conference, volume 1181 of Lecture Notes in Computer Science, page 350-361. Springer, (1996)Introducing Mutual Exclusion in Esterel., and . Ershov Memorial Conference, volume 1755 of Lecture Notes in Computer Science, page 445-459. Springer, (1999)Analysis of Some Semantic Properties for Programs of the Applicative Language AL.. Formal Methods in Programming and Their Applications, volume 735 of Lecture Notes in Computer Science, page 181-189. Springer, (1993)Formale Verifikation eingebetteter Systeme., , , , and . Informationstechnik Tech. Inform., 41 (2): 12-16 (1999)