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 20 papers between 2016 and 2026.

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

2026
Domain-Theoretic Semantics for Functional Logic Programming.
Proc. ACM Program. Lang., 2026

2025
Adequacy for Algebraic Effects Revisited.
Proc. ACM Program. Lang., 2025

Noninterference Through Bisimulation.
Proceedings of the Trends in Functional Programming - 26th International Symposium, 2025

2024
Two-dimensional Kripke Semantics II: Stability and Completeness.
Proceedings of the 40th Conference on the Mathematical Foundations of Programming Semantics, 2024

Two-Dimensional Kripke Semantics I: Presheaves.
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.
Bull. Symb. Log., June, 2023

2022
Modalities and Parametric Adjoints.
ACM Trans. Comput. Log., 2022

Syllepsis in Homotopy Type Theory.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Deeper Shallow Embeddings.
Proceedings of the 13th International Conference on Interactive Theorem Proving, 2022

2021
Client-server sessions in linear logic.
Proc. ACM Program. Lang., 2021

Intensionality, Intensional Recursion and the Gödel-Löb Axiom.
FLAP, 2021

2020
Recurrence extraction for functional programs through call-by-push-value.
Proc. ACM Program. Lang., 2020

Multimodal Dependent Type Theory.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019
Modalities, cohesion, and information flow.
Proc. ACM Program. Lang., 2019

Recurrence Extraction for Functional Programs through Call-by-Push-Value (Extended Version).
CoRR, 2019

2017
On the semantics of intensionality and intensional recursion.
PhD thesis, 2017

On the Semantics of Intensionality and Intensional Recursion.
CoRR, 2017

Dual-context calculi for modal logic.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On the Semantics of Intensionality.
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.
CoRR, 2016


  Loading...