Federico Aschieri
According to our database1,
Federico Aschieri
authored at least 32 papers
between 2008 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
Theor. Comput. Sci., 2020
Par means parallel: multiplicative linear logic proofs as concurrent functional programs.
Proc. ACM Program. Lang., 2020
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
2018
Proceedings of the Proceedings Twelfth Workshop on Developments in Computational Models and Ninth Workshop on Intersection Types and Related Systems, 2018
Proceedings of the Proceedings Ninth International Symposium on Games, 2018
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains.
Proceedings of the Proceedings Seventh International Workshop on Classical Logic and Computation, 2018
2017
Constructive forcing, CPS translations and witness extraction in Interactive realizability.
Math. Struct. Comput. Sci., 2017
Game Semantics and the Geometry of Backtracking: a New Complexity Analysis of Interaction.
J. Symb. Log., 2017
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017
2016
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem.
Theor. Comput. Sci., 2016
Curry-Howard Correspondence for Gödel Logic: from Natural Deduction to Parallel Computation.
CoRR, 2016
On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC.
Log. Methods Comput. Sci., 2016
On Natural Deduction for Herbrand Constructive Logics II: Curry-Howard Correspondence for Markov's Principle in First-Order Logic and Arithmetic.
Proceedings of the 22nd International Conference on Types for Proofs and Programs, 2016
2014
Math. Struct. Comput. Sci., 2014
2013
Proceedings of the Proceedings First Workshop on Control Operators and their Semantics, 2013
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness.
Ann. Pure Appl. Log., 2013
Proceedings of the 19th International Conference on Types for Proofs and Programs, 2013
Proceedings of the Typed Lambda Calculi and Applications, 11th International Conference, 2013
Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013
2012
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
Proceedings of the Proceedings Fourth Workshop on Classical Logic and Computation, 2012
Proceedings of the Computer Science Logic (CSL'12), 2012
2011
Proceedings of the Computer Science Logic, 2011
2010
Proceedings of the Proceedings Third International Workshop on Classical Logic and Computation, 2010
Log. Methods Comput. Sci., 2010
2009
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1.
Proceedings of the Typed Lambda Calculi and Applications, 9th International Conference, 2009
2008
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization.
Fundam. Informaticae, 2008