The following pages link to Marco Gaboardi (Q843950):
Displaying 39 items.
- Simplifying the signature in second-order unification (Q843951) (← links)
- Coupled relational symbolic execution for differential privacy (Q2233459) (← links)
- Graded Hoare logic and its categorical semantics (Q2233460) (← links)
- An assertion-based program logic for probabilistic programs (Q2323970) (← links)
- Relational reasoning for Markov chains in a probabilistic guarded lambda calculus (Q2323974) (← links)
- Realizability models for a linear dependent PCF (Q2346992) (← links)
- Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy (Q2819789) (← links)
- Soft Linear Logic and Polynomial Complexity Classes (Q2866738) (← links)
- Linear dependent types for differential privacy (Q2931812) (← links)
- What is a model for a semantically linear -calculus? (Q2937685) (← links)
- An Implicit Characterization of PSPACE (Q2946666) (← links)
- Computer-Aided Verification for Mechanism Design (Q2959836) (← links)
- Algebras and coalgebras in the light affine Lambda calculus (Q2981949) (← links)
- Combining effects and coeffects via grading (Q2985796) (← links)
- A By-Level Analysis of Multiplicative Exponential Linear Logic (Q3182938) (← links)
- A logical account of pspace (Q3189832) (← links)
- A PolyTime Functional Language from Light Linear Logic (Q3558218) (← links)
- A Soft Type Assignment System for λ-Calculus (Q3608417) (← links)
- Type Inference for a Polynomial Lambda Calculus (Q3638250) (← links)
- Upper Bounds on Stream I/O Using Semantic Interpretations (Q3644754) (← links)
- From light logics to type assignments: a case study (Q3644842) (← links)
- (Q4598248) (← links)
- (Q4598262) (← links)
- Proving Differential Privacy via Probabilistic Couplings (Q4635938) (← links)
- Linear Dependent Types and Relative Completeness (Q4899111) (← links)
- Relational cost analysis in a functional-imperative setting (Q5020903) (← links)
- (Q5150148) (← links)
- Linearity and PCF (Q5176988) (← links)
- Relational cost analysis (Q5370869) (← links)
- A semantic account of metric preservation (Q5370888) (← links)
- A Core Quantitative Coeffect Calculus (Q5410709) (← links)
- On the reification of semantic linearity (Q5741580) (← links)
- Global and Local Space Properties of Stream Programs (Q5747630) (← links)
- Bunched Fuzz: sensitivity for vector metrics (Q6535249) (← links)
- Differentially private confidence intervals for proportions under stratified random sampling (Q6546430) (← links)
- Formalizing algorithmic bounds in the query model in EeasyCrypt (Q6572572) (← links)
- Approximate span liftings. Compositional semantics for relaxations of differential privacy (Q6654479) (← links)
- Probabilistic relational reasoning via metrics (Q6654506) (← links)
- Kleene algebra with commutativity conditions is undecidable (Q6754874) (← links)
