On algebraic abstractions for concurrent separation logics F Farka, A Nanevski, A Banerjee, GA Delbianco, I Fábregas Proceedings of the ACM on Programming Languages 5 (POPL), 1-32, 2021 | 12 | 2021 |
Coinductive soundness of corecursive type class resolution F Farka, E Komendantskaya, K Hammond Logic-Based Program Synthesis and Transformation: 26th International …, 2017 | 9 | 2017 |
Proof-carrying plans C Schwaab, E Komendantskaya, A Hill, F Farka, RPA Petrick, J Wells, ... Practical Aspects of Declarative Languages: 21th International Symposium …, 2019 | 5 | 2019 |
Proof-relevant horn clauses for dependent type inference and term synthesis F Farka, E Komendantskya, K Hammond Theory and Practice of Logic Programming 18 (3-4), 484-501, 2018 | 5 | 2018 |
Developing With Formal Methods at BedRock Systems, Inc. G Malecha, G Stewart, F Farka, J Haag, Y Hirai IEEE Security & Privacy 20 (3), 33-42, 2022 | 4 | 2022 |
Proof-relevant resolution: the foundations of constructive proof automation F Farka Mathematical and Computer Science, 2020 | 2 | 2020 |
Proof-relevant resolution for elaboration of programming languages F Farka Technical Communications of the 34th International Conference on Logic …, 2018 | 1 | 2018 |
Maintainable type classes for Haskell F Farka Univerzita Karlova, Matematicko-fyzikální fakulta, 2014 | 1 | 2014 |
slepice: Towards a Verified Implementation of Type Theory in Type Theory F Farka Logic-Based Program Synthesis and Transformation: 30th International …, 2021 | | 2021 |
CoALP-Ty'16 E Komendantskaya, F Farka arXiv preprint arXiv:1612.03032, 2016 | | 2016 |
Proofs by Resolution and Existential Variables F Farka CoALP-Ty’16, 19, 2016 | | 2016 |
The Brave New World of Haskell Type Classes F Farka | | 2015 |
Implementation of the SF-HRP action selection mechanism F Farka Univerzita Karlova, Matematicko-fyzikální fakulta, 2011 | | 2011 |