From post

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.

 

Другие публикации лиц с тем же именем

Counting polynomial roots in isabelle/hol: a formal proof of the budan-fourier theorem., и . CPP, стр. 52-64. ACM, (2019)Should your specification language be typed., и . ACM Trans. Program. Lang. Syst., 21 (3): 502-526 (1999)Making Sense of Specifications: The Formalization of SET (Transcript of Discussion).. Security Protocols Workshop, том 2133 из Lecture Notes in Computer Science, стр. 82-86. Springer, (2000)Is the Verification Problem for Cryptographic Protocols Solved?., , и . Security Protocols Workshop, том 3364 из Lecture Notes in Computer Science, стр. 183-189. Springer, (2003)Constructing Recursion Operators in Intuitionistic Type Theory. CoRR, (1993)Verifying the Unification Algorithm in LCF. CoRR, (1993)Isabelle: The Next 700 Theorem Provers. CoRR, (1993)From LCF to Isabelle/HOL., , и . Formal Asp. Comput., 31 (6): 675-698 (2019)Finite Automata in Hereditarily Finite Set Theory.. Arch. Formal Proofs, (2015)ML for the working programmer.. Cambridge University Press, (1991)