Linear Interpolation for the Higher-Order Matching Problem. - Aleksy Schubert (TAPSOFT, 1997)

Second-Order Unification and Type Inference for Church-Style Polymorphism. - Aleksy Schubert (POPL, 1998)

Type Inference for First-Order Logic. - Aleksy Schubert (FoSSaCS, 2000)

Partially Typed Terms between Church-Style and Curry-Style. - Ken-etsu Fujita; Aleksy Schubert (IFIP TCS, 2000)

The Complexity of beta-Reduction in Low Orders. - Aleksy Schubert (TLCA, 2001)

A Self-dependency Constraint in the Simply Typed Lambda Calculus. - Aleksy Schubert (FCT, 2005)

KOTEK: Clustering Of The Enterprise Code. - Andrzej Gasienica-Samek; Tomasz Stachowicz; Jacek Chrzaszcz; Aleksy Schubert (Software Engineering: Evolution and Emerging Technologies, 2005)

Minik: A Tool for Maintaining Proper Java Code Structure. - Jacek Chrzaszcz; Tomasz Stachowicz; Andrzej Gasienica-Samek; Aleksy Schubert (SET, 2006)

ESC/Java2 as a Tool to Ensure Security in the Source Code of Java Applications. - Aleksy Schubert; Jacek Chrzaszcz (SET, 2006)

Immutable Objects for a Java-Like Language. - Christian Haack; Erik Poll; Jan Schäfer; Aleksy Schubert (ESOP, 2007)

Extending Operational Semantics of the Java Bytecode. - Patryk Czarnik; Aleksy Schubert (TGC, 2007)

BML and Related Tools. - Jacek Chrzaszcz; Marieke Huisman; Aleksy Schubert (FMCO, 2008)

On the building of affine retractions. - Aleksy Schubert (Math. Struct. Comput. Sci., 2008)

The Existential Fragment of the One-Step Parallel Rewriting Theory. - Aleksy Schubert (RTA, 2009)

Existential Type Systems with No Types in Terms. - Ken-etsu Fujita; Aleksy Schubert (TLCA, 2009)

The Non-Interference Protection in BML. - Aleksy Schubert; Daria Walukiewicz-Chrzaszcz (BYTECODE@ETAPS, 2009)

The Undecidability of Type Related Problems in Type-free Style System F. - Ken-etsu Fujita; Aleksy Schubert (RTA, 2010)

A Dozen Instructions Make Java Bytecode. - Jacek Chrzaszcz; Patryk Czarnik; Aleksy Schubert (Bytecode@ETAPS, 2010)

Relational Abstract Domain of Weighted Hexagons. - Jedrzej Fulara; Konrad Durnoga; Krzysztof Jakubczyk; Aleksy Schubert (NSAD@SAS, 2010)

ML with PTIME complexity guarantees. - Jacek Chrzaszcz; Aleksy Schubert (CSL, 2012)

Testing of Evolving Protocols. - Jacek Chrzaszcz; Patryk Czarnik; Aleksy Schubert; Andrzej Tarlecki (ICST, 2012)

Lucretia - a type system for objects in languages with reflection - Viviana Bono; Marcin Benke; Aleksy Schubert (CoRR, 2012)

The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types. - Ken-etsu Fujita; Aleksy Schubert (Inf. Comput., 2012)

Decidable structures between Church-style and Curry-style. - Ken-etsu Fujita; Aleksy Schubert (RTA, 2013)

Tool Support for Teaching Hoare Logic. - Tadeusz Sznuk; Aleksy Schubert (SEFM, 2014)

Restricted Positive Quantification Is Not Elementary. - Aleksy Schubert; Pawel Urzyczyn; Daria Walukiewicz-Chrzaszcz (TYPES, 2014)

Lucretia - intersection type polymorphism for scripting languages. - Marcin Benke; Viviana Bono; Aleksy Schubert (ITRS, 2014)

On multiply-exponential write-once Turing machines. - Maciej Zielenkiewicz; Aleksy Schubert; Jacek Chrzaszcz (CoRR, 2014)

A note on subject reduction in (→, ∃)-Curry with respect to complete developments. - Aleksy Schubert; Ken-etsu Fujita (Inf. Process. Lett., 2014)

Existential type systems between Church and Curry style (type-free style). - Ken-etsu Fujita; Aleksy Schubert (Theor. Comput. Sci., 2014)

Automata Theoretic Account of Proof Search. - Aleksy Schubert; Wil Dekkers; Hendrik Pieter Barendregt (CSL, 2015)

Java Loops Are Mainly Polynomial. - Maciej Zielenkiewicz; Jacek Chrzaszcz; Aleksy Schubert (SOFSEM, 2015)

Protocol State Machines and Session Languages: Specification, implementation, and Security Flaws. - Erik Poll; Joeri de Ruiter; Aleksy Schubert (IEEE Symposium on Security and Privacy Workshops, 2015)

The impact of proof steps sequence on proof readability - experimental setting. - Karol Pak; Aleksy Schubert (FM4M/MathUI/ThEdu/DP/WIP@CIKM, 2016)

Invited talk: On Differences in Proofs Between Intuitionistic and Classical Logic. - Aleksy Schubert (FM4M/MathUI/ThEdu/DP/WIP@CIKM, 2016)

Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic. - Marcin Benke; Aleksy Schubert; Daria Walukiewicz-Chrzaszcz (FSCD, 2016)

Coq Support in HAHA. - Jacek Chrzaszcz; Aleksy Schubert; Jakub Zakrzewski 003 (TYPES, 2016)

On the Mints Hierarchy in First-Order Intuitionistic Logic. - Aleksy Schubert; Pawel Urzyczyn; Konrad Zdanowski (Log. Methods Comput. Sci., 2016)

The role of polymorphism in the characterisation of complexity by soft types. - Jacek Chrzaszcz; Aleksy Schubert (Inf. Comput., 2016)

How Hard Is Positive Quantification? - Aleksy Schubert; Pawel Urzyczyn; Daria Walukiewicz-Chrzaszcz (ACM Trans. Comput. Log., 2016)

Function definitions for compound values in object-oriented languages. - Jacek Chrzaszcz; Aleksy Schubert (PPDP, 2017)

A Java Bytecode Formalisation. - Patryk Czarnik; Jacek Chrzaszcz; Aleksy Schubert (VSTTE, 2018)

Formalisation of a frame stack semantics for a Java-like language. - Aleksy Schubert; Jacek Chrzaszcz (CoRR, 2018)

First-order Answer Set Programming as Constructive Proof Search. - Aleksy Schubert; Pawel Urzyczyn (Theory Pract. Log. Program., 2018)

Preface. - Thorsten Altenkirch; Aleksy Schubert (Fundam. Informaticae, 2019)

On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note). - Wojciech Plandowski; Aleksy Schubert (Theor. Comput. Sci., 2019)

Automata theory approach to predicate intuitionistic logic. - Maciej Zielenkiewicz; Aleksy Schubert (J. Log. Comput., 2022)

Between proof construction and SAT-solving. - Aleksy Schubert; Pawel Urzyczyn; Konrad Zdanowski (CoRR, 2024)

The existential fragment of second-order propositional intuitionistic logic is undecidable. - Ken-etsu Fujita; Aleksy Schubert; Pawel Urzyczyn; Konrad Zdanowski (J. Appl. Non Class. Logics, 2024)