default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAleksy Schubert
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Ken-etsu Fujita, Aleksy Schubert
, Pawel Urzyczyn, Konrad Zdanowski:
The existential fragment of second-order propositional intuitionistic logic is undecidable. J. Appl. Non Class. Logics 34(1): 55-74 (2024)- [i6]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
Between proof construction and SAT-solving. CoRR abs/2405.05670 (2024) - 2022
- [j11]Maciej Zielenkiewicz, Aleksy Schubert:
Automata theory approach to predicate intuitionistic logic. J. Log. Comput. 32(3): 554-580 (2022)
2010 – 2019
- 2019
- [j10]Thorsten Altenkirch, Aleksy Schubert:
Preface. Fundam. Informaticae 170(1-3): v-vi (2019) - [j9]Wojciech Plandowski, Aleksy Schubert:
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note). Theor. Comput. Sci. 792: 62-68 (2019) - 2018
- [j8]Aleksy Schubert, Pawel Urzyczyn:
First-order Answer Set Programming as Constructive Proof Search. Theory Pract. Log. Program. 18(3-4): 673-690 (2018) - [c36]Patryk Czarnik, Jacek Chrzaszcz, Aleksy Schubert:
A Java Bytecode Formalisation. VSTTE 2018: 135-154 - [i5]Aleksy Schubert, Pawel Urzyczyn:
First-order answer set programming as constructive proof search. CoRR abs/1804.10004 (2018) - [i4]Aleksy Schubert, Jacek Chrzaszcz:
Formalisation of a frame stack semantics for a Java-like language. CoRR abs/1808.05342 (2018) - 2017
- [c35]Jacek Chrzaszcz, Aleksy Schubert:
Function definitions for compound values in object-oriented languages. PPDP 2017: 61-72 - 2016
- [j7]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
On the Mints Hierarchy in First-Order Intuitionistic Logic. Log. Methods Comput. Sci. 12(4) (2016) - [j6]Jacek Chrzaszcz, Aleksy Schubert:
The role of polymorphism in the characterisation of complexity by soft types. Inf. Comput. 248: 130-149 (2016) - [j5]Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz:
How Hard Is Positive Quantification? ACM Trans. Comput. Log. 17(4): 30 (2016) - [c34]Aleksy Schubert:
Invited talk: On Differences in Proofs Between Intuitionistic and Classical Logic. FM4M/MathUI/ThEdu/DP/WIP@CIKM 2016: 3 - [c33]Karol Pak, Aleksy Schubert:
The impact of proof steps sequence on proof readability - experimental setting. FM4M/MathUI/ThEdu/DP/WIP@CIKM 2016: 172-186 - [c32]Maciej Zielenkiewicz, Aleksy Schubert:
Automata Theory Approach to Predicate Intuitionistic Logic. LOPSTR 2016: 345-360 - [c31]Marcin Benke, Aleksy Schubert, Daria Walukiewicz-Chrzaszcz:
Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic. FSCD 2016: 12:1-12:16 - [c30]Jacek Chrzaszcz, Aleksy Schubert, Jakub Zakrzewski:
Coq Support in HAHA. TYPES 2016: 8:1-8:26 - [i3]Maciej Zielenkiewicz, Aleksy Schubert:
Automata Theory Approach to Predicate Intuitionistic Logic. CoRR abs/1608.05698 (2016) - 2015
- [c29]Aleksy Schubert, Wil Dekkers, Hendrik Pieter Barendregt:
Automata Theoretic Account of Proof Search. CSL 2015: 128-143 - [c28]Aleksy Schubert, Pawel Urzyczyn, Konrad Zdanowski:
On the Mints Hierarchy in First-Order Intuitionistic Logic. FoSSaCS 2015: 451-465 - [c27]Maciej Zielenkiewicz, Jacek Chrzaszcz, Aleksy Schubert:
Java Loops Are Mainly Polynomial. SOFSEM 2015: 603-614 - [c26]Erik Poll, Joeri de Ruiter, Aleksy Schubert:
Protocol State Machines and Session Languages: Specification, implementation, and Security Flaws. IEEE Symposium on Security and Privacy Workshops 2015: 125-133 - 2014
- [j4]Aleksy Schubert, Ken-etsu Fujita:
A note on subject reduction in (→, ∃)-Curry with respect to complete developments. Inf. Process. Lett. 114(1-2): 72-75 (2014) - [j3]Ken-etsu Fujita, Aleksy Schubert:
Existential type systems between Church and Curry style (type-free style). Theor. Comput. Sci. 549: 17-35 (2014) - [c25]Tadeusz Sznuk, Aleksy Schubert:
Tool Support for Teaching Hoare Logic. SEFM 2014: 332-346 - [c24]Aleksy Schubert, Pawel Urzyczyn, Daria Walukiewicz-Chrzaszcz:
Restricted Positive Quantification Is Not Elementary. TYPES 2014: 251-273 - [c23]Marcin Benke, Viviana Bono, Aleksy Schubert:
Lucretia - intersection type polymorphism for scripting languages. ITRS 2014: 65-78 - [e1]Ralph Matthes, Aleksy Schubert:
19th International Conference on Types for Proofs and Programs, TYPES 2013, April 22-26, 2013, Toulouse, France. LIPIcs 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-72-9 [contents] - [i2]Maciej Zielenkiewicz, Aleksy Schubert, Jacek Chrzaszcz:
On multiply-exponential write-once Turing machines. CoRR abs/1407.7592 (2014) - 2013
- [c22]Ken-etsu Fujita, Aleksy Schubert:
Decidable structures between Church-style and Curry-style. RTA 2013: 190-205 - 2012
- [j2]Ken-etsu Fujita, Aleksy Schubert:
The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types. Inf. Comput. 218: 69-87 (2012) - [c21]Jacek Chrzaszcz, Aleksy Schubert:
ML with PTIME complexity guarantees. CSL 2012: 198-212 - [c20]Jacek Chrzaszcz, Patryk Czarnik, Aleksy Schubert, Andrzej Tarlecki:
Testing of Evolving Protocols. ICST 2012: 901-906 - [i1]Viviana Bono, Marcin Benke, Aleksy Schubert:
Lucretia - a type system for objects in languages with reflection. CoRR abs/1206.5112 (2012) - 2011
- [c19]Jacek Chrzaszcz, Aleksy Schubert:
The Role of Polymorphism in the Characterisation of Complexity by Soft Types. MFCS 2011: 219-230 - 2010
- [c18]Ken-etsu Fujita, Aleksy Schubert:
The Undecidability of Type Related Problems in Type-free Style System F. RTA 2010: 103-118 - [c17]Jacek Chrzaszcz, Patryk Czarnik, Aleksy Schubert:
A Dozen Instructions Make Java Bytecode. Bytecode@ETAPS 2010: 19-34 - [c16]Jedrzej Fulara, Konrad Durnoga, Krzysztof Jakubczyk, Aleksy Schubert:
Relational Abstract Domain of Weighted Hexagons. NSAD@SAS 2010: 59-72
2000 – 2009
- 2009
- [c15]Aleksy Schubert:
The Existential Fragment of the One-Step Parallel Rewriting Theory. RTA 2009: 78-92 - [c14]Ken-etsu Fujita, Aleksy Schubert:
Existential Type Systems with No Types in Terms. TLCA 2009: 112-126 - [c13]Aleksy Schubert, Daria Walukiewicz-Chrzaszcz:
The Non-Interference Protection in BML. BYTECODE@ETAPS 2009: 113-127 - 2008
- [j1]Aleksy Schubert:
On the building of affine retractions. Math. Struct. Comput. Sci. 18(4): 753-793 (2008) - [c12]Jacek Chrzaszcz, Marieke Huisman, Aleksy Schubert:
BML and Related Tools. FMCO 2008: 278-297 - 2007
- [c11]Christian Haack, Erik Poll, Jan Schäfer, Aleksy Schubert:
Immutable Objects for a Java-Like Language. ESOP 2007: 347-362 - [c10]Patryk Czarnik, Aleksy Schubert:
Extending Operational Semantics of the Java Bytecode. TGC 2007: 57-72 - 2006
- [c9]Aleksy Schubert, Jacek Chrzaszcz:
ESC/Java2 as a Tool to Ensure Security in the Source Code of Java Applications. SET 2006: 337-348 - [c8]Jacek Chrzaszcz, Tomasz Stachowicz, Andrzej Gasienica-Samek, Aleksy Schubert:
Minik: A Tool for Maintaining Proper Java Code Structure. SET 2006: 361-371 - 2005
- [c7]Aleksy Schubert:
A Self-dependency Constraint in the Simply Typed Lambda Calculus. FCT 2005: 352-364 - [p1]Andrzej Gasienica-Samek, Tomasz Stachowicz, Jacek Chrzaszcz, Aleksy Schubert:
KOTEK: Clustering Of The Enterprise Code. Software Engineering: Evolution and Emerging Technologies 2005: 412-417 - 2004
- [c6]Aleksy Schubert:
On the Building of Affine Retractions. CSL 2004: 205-219 - 2001
- [c5]Aleksy Schubert:
The Complexity of beta-Reduction in Low Orders. TLCA 2001: 400-414 - 2000
- [c4]Aleksy Schubert:
Type Inference for First-Order Logic. FoSSaCS 2000: 297-313 - [c3]Ken-etsu Fujita, Aleksy Schubert:
Partially Typed Terms between Church-Style and Curry-Style. IFIP TCS 2000: 505-520
1990 – 1999
- 1998
- [c2]Aleksy Schubert:
Second-Order Unification and Type Inference for Church-Style Polymorphism. POPL 1998: 279-288 - 1997
- [c1]Aleksy Schubert:
Linear Interpolation for the Higher-Order Matching Problem. TAPSOFT 1997: 441-452
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-14 18:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
