Zobrazeno 1 - 10
of 6 071
pro vyhledávání: '"A, Bereczky"'
Autor:
Bereczky, Tamás
Publikováno v:
BMJ: British Medical Journal, 2019 Sep . 366, 1-3.
Externí odkaz:
https://www.jstor.org/stable/27177873
Autor:
Gábor, LÁNYI
Publikováno v:
Studia Universitatis Babes-Bolyai, Theologia Reformata Transylvanica; Jun2024, Vol. 69 Issue 1, p225-249, 25p
Autor:
Lányi, Gábor J.1 (AUTHOR) lanyi.gabor@kre.hu
Publikováno v:
Perichoresis. 2021, Vol. 19 Issue 1, p91-100. 10p.
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.
Publikováno v:
EPTCS 410, 2024, pp. 1-17
Matching logic is a logical framework for specifying and reasoning about programs using pattern matching semantics. A pattern is made up of a number of structural components and constraints. Structural components are syntactically matched, while cons
Externí odkaz:
http://arxiv.org/abs/2410.23760
Autor:
Gábor J. Lányi
Publikováno v:
Perichoresis: The Theological Journal of Emanuel University, Vol 19, Iss 1, Pp 91-100 (2021)
This original research paper discusses Bishop Albert Bereczky’s (1893-1966) first contacts with revivalism, especially his spiritual conversion experience during his adolescent years. Albert Bereczky, Bishop of the Danubian Church District from 194
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3e6b14f8bd8010c3542da8167f79028
https://doaj.org/article/c94c9228125a41279d1f447092654581
https://doaj.org/article/c94c9228125a41279d1f447092654581
Autor:
LÁNYI, Gábor
Publikováno v:
Studia Universitatis Babes-Bolyai, Theologia Reformata Transylvanica; 2024 Suppl 1, Vol. 69, p101-119, 19p
In order to reason about the behaviour of programs described in a programming language, a mathematically rigorous definition of that language is needed. In this paper, we present a machine-checked formalisation of concurrent Core Erlang (a subset of
Externí odkaz:
http://arxiv.org/abs/2311.10482
We present a small-step, frame stack style, semantics for sequential Core Erlang, a dynamically typed, impure functional programming language. The semantics and the properties that we prove are machine-checked with the Coq proof assistant. We improve
Externí odkaz:
http://arxiv.org/abs/2308.12403
We aim to reason about the correctness of behaviour-preserving transformations of Erlang programs. Behaviour preservation is characterised by semantic equivalence. Based upon our existing formal semantics for Core Erlang, we investigate potential def
Externí odkaz:
http://arxiv.org/abs/2208.14260