The following pages link to Michele Pagani (Q409320):
Displayed 26 items.
- Visible acyclic differential nets. I: Semantics (Q409321) (← links)
- Item:Q409320 (redirect page) (← links)
- A semantic measure of the execution time in linear logic (Q534698) (← links)
- Strong normalization property for second order linear logic (Q1044837) (← links)
- Strong adequacy and untyped full-abstraction for probabilistic coherence spaces (Q2289088) (← links)
- Strong Normalizability as a Finiteness Structure via the Taylor Expansion of $$\lambda $$ λ -terms (Q2811355) (← links)
- (Q2958517) (← links)
- The Free Exponential Modality of Probabilistic Coherence Spaces (Q2988358) (← links)
- Linearity, Non-determinism and Solvability (Q3000282) (← links)
- Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion (Q3007664) (← links)
- (Q3300796) (← links)
- Proofs, denotational semantics and observational equivalences in Multiplicative Linear Logic (Q3444645) (← links)
- Call-by-Value Non-determinism in a Linear Logic Type Discipline (Q3455843) (← links)
- The Separation Theorem for Differential Interaction Nets (Q3498483) (← links)
- Solvability in Resource Lambda-Calculus (Q3557862) (← links)
- Acyclicity and Coherence in Multiplicative Exponential Linear Logic (Q3613361) (← links)
- The Cut-Elimination Theorem for Differential Nets with Promotion (Q3637197) (← links)
- Full Abstraction for Probabilistic PCF (Q4561511) (← links)
- (Q5089028) (← links)
- The Benefit of Being Non-Lazy in Probabilistic λ-calculus (Q5145645) (← links)
- New Semantical Insights Into Call-by-Value λ-Calculus (Q5212041) (← links)
- Weighted Relational Models of Typed Lambda-Calculi (Q5271067) (← links)
- (Q5351981) (← links)
- The conservation theorem for differential nets (Q5360213) (← links)
- Probabilistic coherence spaces are fully abstract for probabilistic PCF (Q5408427) (← links)
- Applying quantitative semantics to higher-order quantum computing (Q5408456) (← links)