( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Open System Operational Semantics for an Object-Oriented and Component-Based Language.

, и . FACS, том 215 из Electronic Notes in Theoretical Computer Science, стр. 151-169. Elsevier, (2007)

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.

Jasmin Christian Blanchette

Jasmin Blanchette

Jasmin Geserick

Synthese mesoskopisch organisierter Nanopartikel. Uni Ulm, (2009)

Jasmin Geppert

Jasmin Fertey

 

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

A Formal Proof of the Expressiveness of Deep Learning., , и . J. Autom. Reason., 63 (2): 347-368 (2019)Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk).. CPP, стр. 1-13. ACM, (2019)Intra-Object versus Inter-Object: Concurrency and Reasoning in Creol., , , и . TTSS, том 243 из Electronic Notes in Theoretical Computer Science, стр. 89-103. Elsevier, (2008)A verified prover based on ordered resolution., , и . CPP, стр. 152-165. ACM, (2019)Operations on Bounded Natural Functors., , и . Arch. Formal Proofs, (2017)Selected Extended Papers of ITP 2016: Preface., и . J. Autom. Reason., 62 (2): 169-170 (2019)Scalable Fine-Grained Proofs for Formula Processing., , , и . J. Autom. Reason., 64 (3): 485-510 (2020)An Open System Operational Semantics for an Object-Oriented and Component-Based Language., и . FACS, том 215 из Electronic Notes in Theoretical Computer Science, стр. 151-169. Elsevier, (2007)Extending a Brainiac Prover to Lambda-Free Higher-Order Logic., , , и . TACAS (1), том 11427 из Lecture Notes in Computer Science, стр. 192-210. Springer, (2019)Bindings as bounded natural functors., , , и . Proc. ACM Program. Lang., 3 (POPL): 22:1-22:34 (2019)