We stand with Ukraine  

G. A. Kavvos

Orcid: 0000-0001-7953-7975

Affiliations:
  • University of Bristol, Department of Computer Science, UK
  • University of Oxford, UK (PhD 2017)


According to our database1, G. A. Kavvos authored at least 19 papers between 2016 and 2025.

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

2025
Adequacy for Algebraic Effects Revisited.
[BibTeX]
[DOI]
G. A. Kavvos
Proc. ACM Program. Lang., 2025

Noninterference Through Bisimulation.
[BibTeX]
[DOI]
April Tune
,
Wendy Yang
,
G. A. Kavvos
Proceedings of the Trends in Functional Programming - 26th International Symposium, 2025

2024
Two-dimensional Kripke Semantics II: Stability and Completeness.
[BibTeX]
[DOI]
G. A. Kavvos
CoRR, 2024

Two-Dimensional Kripke Semantics I: Presheaves.
[BibTeX]
[DOI]
Georgios Alexandros Kavvos
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

2023
Under Lock and Key: a Proof System for a Multimodal Logic.
[BibTeX]
[DOI]
G. A. Kavvos
,
Daniel Gratzer
Bull. Symb. Log., June, 2023

2022
Modalities and Parametric Adjoints.
[BibTeX]
[DOI]
Daniel Gratzer
,
Evan Cavallo
,
G. A. Kavvos
,
Adrien Guatto
,
Lars Birkedal
ACM Trans. Comput. Log., 2022

Syllepsis in Homotopy Type Theory.
[BibTeX]
[DOI]
Kristina Sojakova
,
G. A. Kavvos
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Deeper Shallow Embeddings.
[BibTeX]
[DOI]
Jacob Prinz
,
G. A. Kavvos
,
Leonidas Lampropoulos
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

2021
Client-server sessions in linear logic.
[BibTeX]
[DOI]
Zesen Qian
,
G. A. Kavvos
,
Lars Birkedal
Proc. ACM Program. Lang., 2021

Intensionality, Intensional Recursion and the Gödel-Löb Axiom.
[BibTeX]
[DOI]
G. A. Kavvos
FLAP, 2021

2020
Recurrence extraction for functional programs through call-by-push-value.
[BibTeX]
[DOI]
G. A. Kavvos
,
Edward Morehouse
,
Daniel R. Licata
,
Norman Danner
Proc. ACM Program. Lang., 2020

Multimodal Dependent Type Theory.
[BibTeX]
[DOI]
Daniel Gratzer
,
G. A. Kavvos
,
Andreas Nuyts
,
Lars Birkedal
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Modalities, cohesion, and information flow.
[BibTeX]
[DOI]
G. A. Kavvos
Proc. ACM Program. Lang., 2019

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version).
[BibTeX]
[DOI]
G. A. Kavvos
,
Edward Morehouse
,
Daniel R. Licata
,
Norman Danner
CoRR, 2019

2017
On the semantics of intensionality and intensional recursion.
[BibTeX]
[DOI]
Georgios Alexandros Kavvos
PhD thesis, 2017

On the Semantics of Intensionality and Intensional Recursion.
[BibTeX]
[DOI]
G. A. Kavvos
CoRR, 2017

Dual-context calculi for modal logic.
[BibTeX]
[DOI]
G. A. Kavvos
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On the Semantics of Intensionality.
[BibTeX]
[DOI]
G. A. Kavvos
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
The Many Worlds of Modal λ-calculi: I. Curry-Howard for Necessity, Possibility and Time.
[BibTeX]
[DOI]
G. A. Kavvos
CoRR, 2016


  Loading...