( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An Extensible User Interface for Lean 4.

, , и . ITP, том 268 из LIPIcs, стр. 24:1-24:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

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.

Erich Ebner

Max Ebner

Alfred Ebner

Susanne Ebner

Walter Ebner

 

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

A Unifying Splitting Framework., , и . CADE, том 12699 из Lecture Notes in Computer Science, стр. 344-360. Springer, (2021)Symbolic Automata: ω-Regularity Modulo Theories., , , и . CoRR, (2023)Complexity of Decision Problems on Totally Rigid Acyclic Tree Grammars., , и . DLT, том 11088 из Lecture Notes in Computer Science, стр. 291-303. Springer, (2018)Herbrand Constructivization for Automated Intuitionistic Theorem Proving.. TABLEAUX, том 11714 из Lecture Notes in Computer Science, стр. 355-373. Springer, (2019)Efficient Translation of Sequent Calculus Proofs Into Natural Deduction Proofs., и . PAAR@FLoC, том 2162 из CEUR Workshop Proceedings, стр. 17-33. CEUR-WS.org, (2018)Maintaining a Library of Formal Mathematics., , и . CICM, том 12236 из Lecture Notes in Computer Science, стр. 251-267. Springer, (2020)HyperTree Proof Search for Neural Theorem Proving., , , , , , , и . NeurIPS, (2022)Lean Formalization of Extended Regular Expression Matching with Lookarounds., , и . CPP, стр. 118-131. ACM, (2024)System Description: GAPT 2.0., , , , , и . IJCAR, том 9706 из Lecture Notes in Computer Science, стр. 293-301. Springer, (2016)Fast Cut-Elimination using Proof Terms: An Empirical Study.. CL&C, том 281 из EPTCS, стр. 24-38. (2018)