Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

A universal algorithm for Krull's theorem

Autor: Thomas Powell, Franziskus Wiesnet, Peter Schuster

Publikováno v: Powell, T, Schuster, P & Wiesnet, F 2022, ' A universal algorithm for Krull's theorem ', Information and Computation, vol. 287, 104761 . https://doi.org/10.1016/j.ic.2021.104761

We give a computational interpretation to an abstract formulation of Krull's theorem, by analysing its classical proof based on Zorn's lemma. Our approach is inspired by proof theory, and uses a form of update recursion to replace the existence of ma

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8a39525a2ed2eb9761de510ffd41041b
https://purehost.bath.ac.uk/ws/files/219876502/accepted_manuscript_nonformatted.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Fractional Types

Autor: Chen, Chao-Hong, Choudhury, Vikraman, Carette, Jacques, Sabry, Amr

Publikováno v: Reversible Computation

In reversible computing, the management of space is subject to two broad classes of constraints. First, as with general-purpose computation, every allocation must be paired with a matching de-allocation. Second, space can only be safely de-allocated

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pmc_________::d67346addf693168ba5e9f645900648c
http://europepmc.org/articles/PMC7342179

Preface

Autor: Mainzer, Klaus, Schuster, Peter, Schwichtenberg, Helmut

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od______1943::a4d2f1743941622a33586dec36ffa6fa
http://hdl.handle.net/11562/1056998