We stand with Ukraine  

Abhishek De

Orcid: 0009-0003-0402-0391

Affiliations:
  • University of Birmingham, UK
  • University of Paris, IRIF, France


According to our database1, Abhishek De authored at least 9 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A proof theory of right-linear (omega-)grammars via cyclic proofs.
[BibTeX]
[DOI]
Anupam Das
,
Abhishek De
CoRR, 2024

A proof theory of right-linear (ω-)grammars via cyclic proofs.
[BibTeX]
[DOI]
Anupam Das
,
Abhishek De
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded Proofs.
[BibTeX]
[DOI]
Anupam Das
,
Abhishek De
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

2023
Comparing Infinitary Systems for Linear Logic with Fixed Points.
[BibTeX]
[DOI]
Anupam Das
,
Abhishek De
,
Alexis Saurin
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

2022
Linear logic with the least and greatest fixed points : truth semantics, complexity and a parallel syntax. (La logique linéaire avec les plus petits et les plus grands points fixes : la sémantique de vérité, la complexité, et une syntaxe parallèle).
[BibTeX]
[DOI]
Abhishek De
PhD thesis, 2022

Phase Semantics for Linear Logic with Least and Greatest Fixed Points.
[BibTeX]
[DOI]
Abhishek De
,
Farzad Jafarrahmani
,
Alexis Saurin
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Decision Problems for Linear Logic with Least and Greatest Fixed Points.
[BibTeX]
[DOI]
Anupam Das
,
Abhishek De
,
Alexis Saurin
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Canonical proof-objects for coinductive programming: infinets with infinitely many cuts.
[BibTeX]
[DOI]
Abhishek De
,
Luc Pellissier
,
Alexis Saurin
Proceedings of the PPDP 2021: 23rd International Symposium on Principles and Practice of Declarative Programming, 2021

2019
Infinets: The Parallel Syntax for Non-wellfounded Proof-Theory.
[BibTeX]
[DOI]
Abhishek De
,
Alexis Saurin
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019


  Loading...