Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Aleksy Schubert"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 177, Iss Proc. ITRS 2014, Pp 65-78 (2015)
Scripting code may present maintenance problems in the long run. There is, then, the call for methodologies that make it possible to control the properties of programs written in dynamic languages in an automatic fashion. We introduce Lucretia, a cor
Externí odkaz:
https://doaj.org/article/ba9fd08c0adf46758f74d959757d399f
Publikováno v:
Logical Methods in Computer Science, Vol Volume 12, Issue 4 (2017)
We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments. We pro
Externí odkaz:
https://doaj.org/article/85990d3fc5b740598690898a1f8c904c
Autor:
Wojciech Plandowski, Aleksy Schubert
Publikováno v:
Theoretical Computer Science. 792:62-68
Denote by SWE the satisfiability problem for word equations. Consider the problem of computability of the maximal exponent of periodicity for word equations MaxExpProblem ( e , k ) in which given positive integer k and a word equation e one is to che
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::238d2ad4147b2a278320a585eac74287
https://doi.org/10.1016/j.tcs.2018.10.022
https://doi.org/10.1016/j.tcs.2018.10.022
Publikováno v:
ACM Transactions on Computational Logic. 17:1-29
We show that the constructive predicate logic with positive (covariant) quantification is hard for doubly exponential universal time, that is, for the class co- 2-N exptime . Our approach is to represent proof-search as computation of an alternating
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::733004d2f6260bd510ec85a7676e6911
https://doi.org/10.1145/2981544
https://doi.org/10.1145/2981544
Autor:
Jacek Chrząszcz, Aleksy Schubert
Publikováno v:
Information and Computation. 248:130-149
Soft type assignment systems STA, STA + , and STA B characterise by means of reduction of terms computation in complexity classes PTIME, NP, and PSPACE, respectively. All these systems are inspired by linear logic and include polymorphism similar to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b33e4de2ce190fdb7c12234869ebf8b
https://doi.org/10.1016/j.ic.2015.12.011
https://doi.org/10.1016/j.ic.2015.12.011
Autor:
Aleksy Schubert, Paweł Urzyczyn
We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the Mints hiera
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::81727236588b54bd47410964f690dbb6
http://arxiv.org/abs/1804.10004
http://arxiv.org/abs/1804.10004
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030035914
VSTTE
VSTTE
This paper presents the first Coq formalisation of the full Java bytecode instruction set and its semantics. The set of instructions is organised in a hierarchy depending on how the instructions deal with the runtime structures of the Java Virtual Ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e72191ab2bc7adf02b0a97099187f8a8
https://doi.org/10.1007/978-3-030-03592-1_8
https://doi.org/10.1007/978-3-030-03592-1_8
Autor:
Thorsten Altenkirch, Aleksy Schubert
Publikováno v:
Fundamenta Informaticae. 170:v-vi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddb833a43f785ba4341f418d1719fa6d
https://doi.org/10.3233/fi-2019-1852
https://doi.org/10.3233/fi-2019-1852
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 177, Iss Proc. ITRS 2014, Pp 65-78 (2015)
ITRS
ITRS
Scripting code may present maintenance problems in the long run. There is, then, the call for methodologies that make it possible to control the properties of programs written in dynamic languages in an automatic fashion. We introduce Lucretia, a cor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8d94f5d7210a63dbde4d48e9fc16fad0
https://doaj.org/article/ba9fd08c0adf46758f74d959757d399f
https://doaj.org/article/ba9fd08c0adf46758f74d959757d399f
Autor:
Aleksy Schubert, Jacek Chrząszcz
Publikováno v:
PPDP
Declarative programming features are gradually included in the design of object-oriented languages such as Java and C++. These languages recently adopted anonymous function definitions and offer basic primitives that restrict changes on data, namely
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93444c84843f21e6a1bd06103690356f
https://doi.org/10.1145/3131851.3131860
https://doi.org/10.1145/3131851.3131860