Lukasz Czajka

Orcid: 0000-0001-8083-4280

Affiliations:
  • TU Dortmund University, Faculty of Informatics, Germany
  • University of Copenhagen, Denmark (2016 - 2018)
  • University of Innsbruck, Austria (2015 - 2016)
  • University of Warsaw, Poland (PhD 2015)


According to our database1, Lukasz Czajka authored at least 22 papers between 2011 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Beyond Backtracking: Connections in Fine-Grained Concurrent Separation Logic.
Proc. ACM Program. Lang., 2023

2022
Restricting Tree Grammars with Term Rewriting.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2020
A new coinductive confluence proof for infinitary lambda calculus.
Log. Methods Comput. Sci., 2020

An operational interpretation of coinductive types.
Log. Methods Comput. Sci., 2020

Practical Proof Search for Coq by Type Inhabitation.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Polymorphic Higher-Order Termination.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

First-Order Guarded Coinduction in Coq.
Proceedings of the 10th International Conference on Interactive Theorem Proving, 2019

2018
Hammer for Coq: Automation for Dependent Type Theory.
J. Autom. Reason., 2018

An infinitary rewriting interpretation of coinductive types.
CoRR, 2018

Term Rewriting Characterisation of LOGSPACE for Finite and Infinite Data.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Concrete Semantics with Coq and CoqHammer.
Proceedings of the Intelligent Computer Mathematics - 11th International Conference, 2018

2017
Confluence of an Extension of Combinatory Logic by Boolean Constants.
Proceedings of the 2nd International Conference on Formal Structures for Computation and Deduction, 2017

2016
Goal Translation for a Hammer for Coq (Extended Abstract).
Proceedings of the Proceedings First International Workshop on Hammers for Type Theories, 2016

A Shallow Embedding of Pure Type Systems into First-Order Logic.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016

Improving automation in interactive theorem provers by efficient encoding of lambda-abstractions.
Proceedings of the 5th ACM SIGPLAN Conference on Certified Programs and Proofs, 2016

2015
On the equivalence of different presentations of Turner's bracket abstraction algorithm.
CoRR, 2015

Coinductive Techniques in Infinitary Lambda-Calculus.
CoRR, 2015

Confluence of nearly orthogonal infinitary term rewriting systems.
Proceedings of the 26th International Conference on Rewriting Techniques and Applications, 2015

2014
A Coinductive Confluence Proof for Infinitary Lambda-Calculus.
Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013
Higher-order illative combinatory logic.
J. Symb. Log., 2013

Partiality and Recursion in Higher-Order Logic.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2011
A Semantic Approach to Illative Combinatory Logic.
Proceedings of the Computer Science Logic, 2011


  Loading...