default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFederico Aschieri
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]Federico Aschieri, Francesco A. Genco:
Par means parallel: multiplicative linear logic proofs as concurrent functional programs. Proc. ACM Program. Lang. 4(POPL): 18:1-18:28 (2020)- [j11]Federico Aschieri, Agata Ciabattoni
, Francesco A. Genco:
On the concurrent computational content of intermediate logics. Theor. Comput. Sci. 813: 375-409 (2020) - [c15]Federico Aschieri, Agata Ciabattoni, Francesco Antonio Genco:
A typed parallel lambda-calculus via 1-depth intermediate proofs. LPAR 2020: 68-89
2010 – 2019
- 2019
- [j10]Federico Aschieri, Stefan Hetzl, Daniel Weller:
Expansion trees with cut. Math. Struct. Comput. Sci. 29(8): 1009-1029 (2019) - [i6]Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
A typed parallel $λ$-calculus for graph-based communication. CoRR abs/1902.03882 (2019) - [i5]Federico Aschieri, Francesco A. Genco:
⅋ means Parallel: Multiplicative Linear Logic Proofs as Concurrent Functional Programs. CoRR abs/1907.03631 (2019) - 2018
- [c14]Federico Aschieri:
On Natural Deduction for Herbrand Constructive Logics III: The Strange Case of the Intuitionistic Logic of Constant Domains. CL&C 2018: 1-9 - [c13]Federico Aschieri:
Natural Deduction and Normalization Proofs for the Intersection Type Discipline. DCM/ITRS 2018: 29-37 - [c12]Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
Classical Proofs as Parallel Programs. GandALF 2018: 43-57 - [i4]Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
Disjunctive Axioms and Concurrent λ-Calculi: a Curry-Howard Approach. CoRR abs/1802.00961 (2018) - 2017
- [j9]Federico Aschieri:
Game Semantics and the Geometry of Backtracking: a New Complexity Analysis of Interaction. J. Symb. Log. 82(2): 672-708 (2017) - [j8]Federico Aschieri:
Constructive forcing, CPS translations and witness extraction in Interactive realizability. Math. Struct. Comput. Sci. 27(6): 993-1031 (2017) - [c11]Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
Gödel logic: From natural deduction to parallel computation. LICS 2017: 1-12 - 2016
- [j7]Federico Aschieri:
On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC. Log. Methods Comput. Sci. 12(3) (2016) - [j6]Federico Aschieri, Margherita Zorzi:
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem. Theor. Comput. Sci. 625: 125-146 (2016) - [c10]Federico Aschieri, Matteo Manighetti:
On Natural Deduction for Herbrand Constructive Logics II: Curry-Howard Correspondence for Markov's Principle in First-Order Logic and Arithmetic. TYPES 2016: 4:1-4:17 - [i3]Federico Aschieri, Agata Ciabattoni, Francesco A. Genco:
Curry-Howard Correspondence for Gödel Logic: from Natural Deduction to Parallel Computation. CoRR abs/1607.05120 (2016) - [i2]Federico Aschieri, Matteo Manighetti:
On Natural Deduction for Herbrand Constructive Logics II: Curry-Howard Correspondence for Markov's Principle in First-Order Logic and Arithmetic. CoRR abs/1612.05457 (2016) - 2015
- [i1]Federico Aschieri:
Game Semantics and the Geometry of Backtracking: a New Complexity Analysis of Interaction. CoRR abs/1511.06260 (2015) - 2014
- [j5]Federico Aschieri:
Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1. Math. Struct. Comput. Sci. 24(6) (2014) - 2013
- [j4]Federico Aschieri:
Learning based realizability for HA + EM1 and 1-Backtracking games: Soundness and completeness. Ann. Pure Appl. Log. 164(6): 591-617 (2013) - [c9]Federico Aschieri, Stefano Berardi, Giovanni Birolo:
Realizability and Strong Normalization for a Curry-Howard Interpretation of HA + EM1. CSL 2013: 45-60 - [c8]Federico Aschieri, Margherita Zorzi:
Non-determinism, Non-termination and the Strong Normalization of System T. TLCA 2013: 31-47 - [c7]Federico Aschieri, Margherita Zorzi:
A "Game Semantical" Intuitionistic Realizability Validating Markov's Principle. TYPES 2013: 24-44 - [c6]Federico Aschieri:
Strong Normalization for HA + EM1 by Non-Deterministic Choice. COS 2013: 1-14 - 2012
- [j3]Federico Aschieri:
A constructive analysis of learning in Peano Arithmetic. Ann. Pure Appl. Log. 163(11): 1448-1470 (2012) - [c5]Federico Aschieri:
Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms. CSL 2012: 31-45 - [c4]Federico Aschieri, Margherita Zorzi:
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic. CL&C 2012: 1-18 - 2011
- [b1]Federico Aschieri:
Learning, realizability and games in classical arithmetic. Queen Mary University of London, UK, 2011 - [c3]Federico Aschieri:
Transfinite Update Procedures for Predicative Systems of Analysis. CSL 2011: 20-34 - 2010
- [j2]Federico Aschieri, Stefano Berardi:
Interactive Learning-Based Realizability for Heyting Arithmetic with EM1. Log. Methods Comput. Sci. 6(3) (2010) - [c2]Federico Aschieri:
Interactive Learning Based Realizability and 1-Backtracking Games. CL&C 2010: 6-20
2000 – 2009
- 2009
- [c1]Federico Aschieri, Stefano Berardi:
Interactive Learning-Based Realizability Interpretation for Heyting Arithmetic with EM1. TLCA 2009: 20-34 - 2008
- [j1]Corrado Biasi, Federico Aschieri:
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization. Fundam. Informaticae 84(2): 185-205 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
