Francesco A. Genco

Orcid: 0000-0001-7415-5839

Affiliations:
  • TU Wien, Vienna, Autria


According to our database1, Francesco A. Genco authored at least 22 papers between 2015 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation.
CoRR, 2024

Evaluating AI fairness in credit scoring with the BRIO tool.
CoRR, 2024

A Logic of Knowledge and Justifications, with an Application to Computational Trust.
CoRR, 2024

2023
A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs.
CoRR, 2023

BRIOxAlkemy: a Bias Detecting Tool.
Proceedings of the 2nd Workshop on Bias, 2023

2021
Grounding, Quantifiers, and Paradoxes.
J. Philos. Log., 2021

Formal explanations as logical derivations.
J. Appl. Non Class. Logics, 2021

Defining Formal Explanation in Classical Logic by Substructural Derivability.
Proceedings of the Connecting with Computability, 2021

2020
On the concurrent computational content of intermediate logics.
Theor. Comput. Sci., 2020

Par means parallel: multiplicative linear logic proofs as concurrent functional programs.
Proc. ACM Program. Lang., 2020

A typed parallel lambda-calculus via 1-depth intermediate proofs.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

2019
⅋ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs.
CoRR, 2019

A typed parallel $λ$-calculus for graph-based communication.
CoRR, 2019

2018
Hypersequents and Systems of Rules: Embeddings and Applications.
ACM Trans. Comput. Log., 2018

Substructural logics: <i>semantics, proof theory, and applications.</i> report on the second SYSMICS workshop.
ACM SIGLOG News, 2018

Classical Proofs as Parallel Programs.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018

Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach.
CoRR, 2018

2017
Mīmā\d{m}sā deontic logic: proof theory and applications.
CoRR, 2017

Gödel logic: From natural deduction to parallel computation.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Curry-Howard Correspondence for Gödel Logic: from Natural Deduction to Parallel Computation.
CoRR, 2016

Embedding formalisms: hypersequents and two-level systems of rule.
Proceedings of the Advances in Modal Logic 11, 2016

2015
Mīmāṃsā Deontic Logic: Proof Theory and Applications.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2015


  Loading...