A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization. - Corrado Biasi; Federico Aschieri (Fundam. Informaticae, 2008)

Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1. - Federico Aschieri; Stefano Berardi (TLCA, 2009)

Interactive Learning-Based Realizability for Heyting Arithmetic with EM1 - Federico Aschieri; Stefano Berardi (Log. Methods Comput. Sci., 2010)

Interactive Learning Based Realizability and 1-Backtracking Games - Federico Aschieri (CL&C, 2010)

Transfinite Update Procedures for Predicative Systems of Analysis. - Federico Aschieri (CSL, 2011)

Learning, realizability and games in classical arithmetic. - Federico Aschieri (2011)

Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms. - Federico Aschieri (CSL, 2012)

A constructive analysis of learning in Peano Arithmetic. - Federico Aschieri (Ann. Pure Appl. Log., 2012)

Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic - Federico Aschieri; Margherita Zorzi (CL&C, 2012)

Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1. - Federico Aschieri; Stefano Berardi; Giovanni Birolo (CSL, 2013)

Non-determinism, Non-termination and the Strong Normalization of System T. - Federico Aschieri; Margherita Zorzi (TLCA, 2013)

A "Game Semantical" Intuitionistic Realizability Validating Markov's Principle. - Federico Aschieri; Margherita Zorzi (TYPES, 2013)

Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness. - Federico Aschieri (Ann. Pure Appl. Log., 2013)

Strong Normalization for HA + EM1 by Non-Deterministic Choice. - Federico Aschieri (COS, 2013)

Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1. - Federico Aschieri (Math. Struct. Comput. Sci., 2014)

On Natural Deduction for Herbrand Constructive Logics II: Curry-Howard Correspondence for Markov's Principle in First-Order Logic and Arithmetic. - Federico Aschieri; Matteo Manighetti (TYPES, 2016)

On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC. - Federico Aschieri (Log. Methods Comput. Sci., 2016)

Curry-Howard Correspondence for Gödel Logic: from Natural Deduction to Parallel Computation. - Federico Aschieri; Agata Ciabattoni; Francesco A. Genco (CoRR, 2016)

On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem. - Federico Aschieri; Margherita Zorzi (Theor. Comput. Sci., 2016)

Gödel logic: From natural deduction to parallel computation. - Federico Aschieri; Agata Ciabattoni; Francesco A. Genco (LICS, 2017)

Game Semantics and the Geometry of Backtracking: a New Complexity Analysis of Interaction. - Federico Aschieri (J. Symb. Log., 2017)

Constructive forcing, CPS translations and witness extraction in Interactive realizability. - Federico Aschieri (Math. Struct. Comput. Sci., 2017)

Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach. - Federico Aschieri; Agata Ciabattoni; Francesco A. Genco (CoRR, 2018)

On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains. - Federico Aschieri (CL&C, 2018)

Classical Proofs as Parallel Programs. - Federico Aschieri; Agata Ciabattoni; Francesco A. Genco (GandALF, 2018)

Natural Deduction and Normalization Proofs for the Intersection Type Discipline. - Federico Aschieri (DCM/ITRS, 2018)

A typed parallel $λ$-calculus for graph-based communication. - Federico Aschieri; Agata Ciabattoni; Francesco A. Genco (CoRR, 2019)

⅋ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs. - Federico Aschieri; Francesco A. Genco (CoRR, 2019)

Expansion trees with cut. - Federico Aschieri; Stefan Hetzl; Daniel Weller 001 (Math. Struct. Comput. Sci., 2019)

A typed parallel lambda-calculus via 1-depth intermediate proofs. - Federico Aschieri; Agata Ciabattoni; Francesco Antonio Genco (LPAR, 2020)

Par means parallel: multiplicative linear logic proofs as concurrent functional programs. - Federico Aschieri; Francesco A. Genco (Proc. ACM Program. Lang., 2020)

On the concurrent computational content of intermediate logics. - Federico Aschieri; Agata Ciabattoni; Francesco A. Genco (Theor. Comput. Sci., 2020)