Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Lochbihler, Andreas"'
Autor:
Bernauer, Alexander, Faro, Sofia, Hämmerle, Rémy, Huschenbett, Martin, Kiefer, Moritz, Lochbihler, Andreas, Mäki, Jussi, Mazzoli, Francesco, Meier, Simon, Mitchell, Neil, Veprek, Ratko G.
Distributed ledger technologies, also known as blockchains for enterprises, promise to significantly reduce the high cost of automating multi-party business workflows. We argue that a programming language for writing such on-ledger logic should satis
Externí odkaz:
http://arxiv.org/abs/2303.03749
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 1, 2022) lmcs:7354
The functorial structure of type constructors is the foundation for many definition and proof principles in higher-order logic (HOL). For example, inductive and coinductive datatypes can be built modularly from bounded natural functors (BNFs), a clas
Externí odkaz:
http://arxiv.org/abs/2104.05348
Cardinality estimators like HyperLogLog are sketching algorithms that estimate the number of distinct elements in a large multiset. Their use in privacy-sensitive contexts raises the question of whether they leak private information. In particular, c
Externí odkaz:
http://arxiv.org/abs/1808.05879
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Lochbihler, Andreas
Aharoni et al. [Ron Aharoni et al., 2010] proved the max-flow min-cut theorem for countable networks, namely that in every countable network with finite edge capacities, there exists a flow and a cut such that the flow saturates all outgoing edges of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01515c4bb7c381bb38c80a035cf8aeca
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Blanchette, Jasmin Christian, Bouzy, Aymeric, Lochbihler, Andreas, Popescu, Andrei, Traytel, Dmitriy, Yang, Hongseok
Publikováno v:
Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017
Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017, Apr 2017, Uppsala, Sweden
Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings, 111-140
STARTPAGE=111;ENDPAGE=140;TITLE=Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings
Programming Languages and Systems ISBN: 9783662544334
ESOP
Blanchette, J C, Bouzy, A, Lochbihler, A, Popescu, A & Traytel, D 2017, Friends with benefits : Implementing corecursion in foundational proof assistants . in H Yang (ed.), Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10201 LNCS, Springer/Verlag, pp. 111-140, 26th European Symposium on Programming, ESOP 2017 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, 22/04/17 . https://doi.org/10.1007/978-3-662-54434-1_5
Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017, Apr 2017, Uppsala, Sweden
Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings, 111-140
STARTPAGE=111;ENDPAGE=140;TITLE=Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings
Programming Languages and Systems ISBN: 9783662544334
ESOP
Blanchette, J C, Bouzy, A, Lochbihler, A, Popescu, A & Traytel, D 2017, Friends with benefits : Implementing corecursion in foundational proof assistants . in H Yang (ed.), Programming Languages and Systems-26th European Symposium on Programming, ESOP 2017 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10201 LNCS, Springer/Verlag, pp. 111-140, 26th European Symposium on Programming, ESOP 2017 held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, 22/04/17 . https://doi.org/10.1007/978-3-662-54434-1_5
International audience; We introduce AmiCo, a tool that extends a proof assistant, Isabelle/ HOL, with flexible function definitions well beyond primitive corecursion. All definitions are certified by the assistant's inference kernel to guard against
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1200a5df5ef6dfa939f8e4a9e70a21e4
https://inria.hal.science/hal-01599167/file/conf.pdf
https://inria.hal.science/hal-01599167/file/conf.pdf