Aleksy Schubert

Konrad Zdanowski

CoRR, 2024

2022

Automata theory approach to predicate intuitionistic logic.

[BibT_eX]

[DOI]

Maciej Zielenkiewicz

J. Log. Comput., 2022

2019

On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note).

[BibT_eX]

[DOI]

Wojciech Plandowski

Theor. Comput. Sci., 2019

Preface.

[BibT_eX]

[DOI]

Thorsten Altenkirch

Fundam. Informaticae, 2019

2018

First-order Answer Set Programming as Constructive Proof Search.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2018

Formalisation of a frame stack semantics for a Java-like language.

[BibT_eX]

[DOI]

CoRR, 2018

A Java Bytecode Formalisation.

[BibT_eX]

[DOI]

Patryk Czarnik

Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

2017

Function definitions for compound values in object-oriented languages.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

2016

How Hard Is Positive Quantification?

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2016

The role of polymorphism in the characterisation of complexity by soft types.

[BibT_eX]

[DOI]

Inf. Comput., 2016

On the Mints Hierarchy in First-Order Intuitionistic Logic.

[BibT_eX]

[DOI]

Konrad Zdanowski

Log. Methods Comput. Sci., 2016

Coq Support in HAHA.

[BibT_eX]

[DOI]

Jakub Zakrzewski

Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

Synthesis of Functional Programs with Help of First-Order Intuitionistic Logic.

[BibT_eX]

[DOI]

Marcin Benke

Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Invited talk: On Differences in Proofs Between Intuitionistic and Classical Logic.

[BibT_eX]

[DOI]

Proceedings of the Joint Proceedings of the FM4M, 2016

The impact of proof steps sequence on proof readability - experimental setting.

[BibT_eX]

[DOI]

Karol Pak

Proceedings of the Joint Proceedings of the FM4M, 2016

2015

Protocol State Machines and Session Languages: Specification, implementation, and Security Flaws.

[BibT_eX]

[DOI]

Erik Poll

Joeri de Ruiter

Proceedings of the 2015 IEEE Symposium on Security and Privacy Workshops, 2015

Java Loops Are Mainly Polynomial.

[BibT_eX]

[DOI]

Maciej Zielenkiewicz

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

Automata Theoretic Account of Proof Search.

[BibT_eX]

[DOI]

Hendrik Pieter Barendregt

Wil Dekkers

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Existential type systems between Church and Curry style (type-free style).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

A note on subject reduction in (→, ∃)-Curry with respect to complete developments.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

On multiply-exponential write-once Turing machines.

[BibT_eX]

[DOI]

Maciej Zielenkiewicz

CoRR, 2014

Lucretia - intersection type polymorphism for scripting languages.

[BibT_eX]

[DOI]

Marcin Benke

Viviana Bono

Proceedings of the Proceedings Seventh Workshop on Intersection Types and Related Systems, 2014

Restricted Positive Quantification Is Not Elementary.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Types for Proofs and Programs, 2014

Tool Support for Teaching Hoare Logic.

[BibT_eX]

[DOI]

Tadeusz Sznuk

Proceedings of the Software Engineering and Formal Methods - 12th International Conference, 2014

2013

Decidable structures between Church-style and Curry-style.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

2012

The undecidability of type related problems in the type-free style System F with finitely stratified polymorphic types.

[BibT_eX]

[DOI]

Inf. Comput., 2012

Lucretia - a type system for objects in languages with reflection

[BibT_eX]

[DOI]

Viviana Bono

Marcin Benke

CoRR, 2012

Testing of Evolving Protocols.

[BibT_eX]

[DOI]

Proceedings of the Fifth IEEE International Conference on Software Testing, 2012

ML with PTIME complexity guarantees.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic (CSL'12), 2012

2010

Relational Abstract Domain of Weighted Hexagons.

[BibT_eX]

[DOI]

Proceedings of the Proceeding of the Second International Workshop on Numerical and Symbolic Abstract Domains, 2010

A Dozen Instructions Make Java Bytecode.

[BibT_eX]

[DOI]

Patryk Czarnik

Proceedings of the Fifth Workshop on Bytecode Semantics, 2010

The Undecidability of Type Related Problems in Type-free Style System F.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Rewriting Techniques and Applications, 2010

2009

The Non-Interference Protection in BML.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Bytecode Semantics, 2009

Existential Type Systems with No Types in Terms.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009

The Existential Fragment of the One-Step Parallel Rewriting Theory.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

2008

On the building of affine retractions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2008

BML and Related Tools.

[BibT_eX]

[DOI]

Marieke Huisman

Proceedings of the Formal Methods for Components and Objects, 7th International Symposium, 2008

2007

Extending Operational Semantics of the Java Bytecode.

[BibT_eX]

[DOI]

Patryk Czarnik

Proceedings of the Trustworthy Global Computing, Third Symposium, 2007

Immutable Objects for a Java-Like Language.

[BibT_eX]

[DOI]

Proceedings of the Programming Languages and Systems, 2007

2006

ESC/Java2 as a Tool to Ensure Security in the Source Code of Java Applications.

[BibT_eX]

[DOI]

Proceedings of the Software Engineering Techniques: Design for Quality, 2006

Minik: A Tool for Maintaining Proper Java Code Structure.

[BibT_eX]

[DOI]

Tomasz Stachowicz

Andrzej Gasienica-Samek

Proceedings of the Software Engineering Techniques: Design for Quality, 2006

2005

KOTEK: Clustering Of The Enterprise Code.

[BibT_eX]

[DOI]

Andrzej Gasienica-Samek

Tomasz Stachowicz

Proceedings of the Software Engineering: Evolution and Emerging Technologies, 2005

A Self-dependency Constraint in the Simply Typed Lambda Calculus.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2001

The Complexity of beta-Reduction in Low Orders.

[BibT_eX]

[DOI]

Proceedings of the Typed Lambda Calculi and Applications, 5th International Conference, 2001

2000

Partially Typed Terms between Church-Style and Curry-Style.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 2000

Type Inference for First-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2000

1998

Second-Order Unification and Type Inference for Church-Style Polymorphism.

[BibT_eX]

[DOI]

Proceedings of the POPL '98, 1998

1997

Linear Interpolation for the Higher-Order Matching Problem.

[BibT_eX]

[DOI]