- 22
- 5
- 4
- 3
Michele Pagani
34
Documents
Research domains
Publications
- 15
- 6
- 6
- 6
- 5
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
The Sum-Product Algorithm For Quantitative Multiplicative Linear Logic8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023), 2023, Roma, Italy. pp.8:1--8:18, ⟨10.4230/LIPIcs.FSCD.2023.8⟩
Conference papers
hal-04267615v1
|
The Benefit of Being Non-Lazy in Probabilistic λ-calculus : Applicative Bisimulation is Fully Abstract for Non-Lazy Probabilistic Call-by-NameLICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2020, Saarbrücken, Germany. pp.327-340, ⟨10.1145/3373718.3394806⟩
Conference papers
hal-03586172v1
|
|
|
|
The Discriminating Power of the Let-In Operator in the Lazy Call-by-Name Probabilistic λ-Calculus4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019), Jun 2019, Dortmund, Germany. ⟨10.4230/LIPIcs.FSCD.2019.26⟩
Conference papers
hal-04670084v1
|
|
|
The Free Exponential Modality of Probabilistic Coherence SpacesFoundations of Software Science and Computation Structures (FOSSACS 2017), Apr 2017, Uppsala, Sweden. pp.20-35, ⟨10.1007/978-3-662-54458-7_2⟩
Conference papers
hal-02357979v1
|
|
|
Strong Normalizability as a Finiteness Structure via the Taylor Expansion of λ -terms19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2016), Apr 2016, Eindhoven, Netherlands. pp 408-423
Conference papers
hal-01292923v1
|
Toward analytic rewriting theoryInformal Electronic Proceedings of the 8th International Workshop on Higher-Order Rewriting (HOR’16), 2016, Porto, Portugal
Conference papers
hal-01763461v1
|
|
|
|
Modelling Coeffects in the Relational Semantics of Linear Logic24th EACSL Annual Conference on Computer Science Logic (CSL 2015), EACSL, Sep 2015, Berlin, Germany. ⟨10.4230/LIPIcs.CSL.2015.567⟩
Conference papers
hal-04670088v1
|
|
|
Applying quantitative semantics to higher-order quantum computingProceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM SIGPLAN-SIGACT, Jan 2014, San Diego (California), United States. pp.647-658, ⟨10.1145/2578855.2535879⟩
Conference papers
hal-04670287v1
|
|
|
Probabilistic coherence spaces are fully abstract for probabilistic PCFThe 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '14), Jan 2014, San Diego, CA, United States. pp.309-320, ⟨10.1145/2535838.2535865⟩
Conference papers
hal-04670288v1
|
Weighted Relational Models of Typed Lambda-Calculi28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013, Jun 2013, New Orleans, LA, United States. ⟨10.1109/LICS.2013.36⟩
Conference papers
hal-01144064v1
|
|
|
|
A characterization of the Taylor expansion of lambda-terms22nd EACSL Annual Conference Computer Science Logic (CSL 2013), EACSL, Sep 2013, Turin, Italy. pp.101-115, ⟨10.4230/LIPIcs.CSL.2013.101⟩
Conference papers
hal-04670289v1
|
|
|
Call-by-value non-determinism in a linear logic type disciplineLFCS - Logical Foundations of Computer Science - 2013, Jan 2013, San Diego, CA, United States. pp.164-178, ⟨10.1007/978-3-642-35722-0_12⟩
Conference papers
hal-00919463v1
|
|
|
Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion10th International Conference on Typed Lambda Calculi and Applications (TLCA 2011), 2011, Oxford, United Kingdom. pp.153-168, ⟨10.1007/978-3-642-21691-6_14⟩
Conference papers
hal-04670290v1
|
|
|
The computational meaning of probabilistic coherent spacesLogic in Computer Science (LICS), Jun 2011, Toronto, ON, Canada. pp.87 - 96, ⟨10.1109/LICS.2011.29⟩
Conference papers
hal-00627490v1
|
|
|
The inverse Taylor expansion problem in linear logicLogic in Computer Science, Aug 2009, Los Angeles, United States. pp.222--231, ⟨10.1109/LICS.2009.19⟩
Conference papers
hal-00440684v1
|
|
|
The Cut-Elimination Thereom for Differential Nets with Promotion9th International Conference on Typed Lambda Calculi and Applications (TLCA 2009), Jul 2009, Brasilia, Brazil. pp.219-233, ⟨10.1007/978-3-642-02273-9_17⟩
Conference papers
hal-00698974v1
|
|
|
Parallel Reduction in Resource Lambda-Calculus7th Asian Symposium on Programming Languages and Systems (APLAS 2009), Dec 2009, Seoul, South Korea. pp.226-242, ⟨10.1007/978-3-642-10672-9_17⟩
Conference papers
hal-00699013v1
|
|
|
The Separation Theorem for Differential Interaction Nets14th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2007), Oct 2007, Yerevan, Armenia. pp.393-407, ⟨10.1007/978-3-540-75560-9_29⟩
Conference papers
hal-04670297v1
|
|
|
Acyclicity and Coherence in Multiplicative Exponential Linear LogicComputer Science Logic. CSL 2006, EACSL, 2006, Szeged, Hungary. pp.531-545, ⟨10.1007/11874683_35⟩
Conference papers
hal-04670298v1
|
|
|
Stream Associative Nets and Lambda-mu-calculus[Research Report] RR-6431, INRIA. 2008, pp.48
Reports
inria-00221221v3
|
|
|
A semantic measure of the execution time in Linear Logic[Research Report] RR-6441, INRIA. 2008, pp.48
Reports
inria-00206099v4
|
Proof nets and cliques: towards the understanding of analytical proofsLogic [math.LO]. Università Roma Tre; Université de la Méditerrannée, 2006. English. ⟨NNT : ⟩
Theses
tel-04670310v1
|
Some Advances in Linear LogicLogic in Computer Science [cs.LO]. Université Paris Nord (Paris 13), 2013
Habilitation à diriger des recherches
tel-04670301v1
|