The following pages link to Simone Martini (Q596036):
Displayed 47 items.
- Phase semantics and decidability of elementary affine logic (Q596037) (← links)
- The weak lambda calculus as a reasonable machine (Q930866) (← links)
- Programming languages: Principles and paradigms (Q1049892) (← links)
- Categorical models of polymorphism (Q1193592) (← links)
- Enriched categorical semantics for distributed calculi (Q1208210) (← links)
- Item:Q596036 (redirect page) (← links)
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus (Q1314360) (← links)
- An extension of system \(F\) with subtyping (Q1322473) (← links)
- Decidability and confluence of \(\beta\eta\text{top}_ \leqslant\) reduction in \({\mathbb{F}}_ \leqslant\) (Q1322474) (← links)
- Classical logic, storage operators and second-order lambda-calculus (Q1326769) (← links)
- Proof-functional connectives and realizability (Q1330311) (← links)
- Interpreting higher computations as types with totality (Q1337495) (← links)
- Experiments in linear natural deduction (Q1392279) (← links)
- Coherence for sharing proof-nets (Q1398472) (← links)
- Item:Q596036 (redirect page) (← links)
- Proof nets, garbage, and computations (Q1589650) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- Sequent reconstruction in LLM -- A sweepline proof (Q1892938) (← links)
- (Q2778817) (← links)
- On Constructor Rewrite Systems and the Lambda Calculus (Q2904629) (← links)
- Light logics and higher-order processes (Q2971072) (← links)
- Convergence Analysis of Distributed Set-Valued Information Systems (Q2980519) (← links)
- (Q3024907) (← links)
- Types in Programming Languages, Between Modelling, Abstraction, and Correctness (Q3188252) (← links)
- Steering a Leader-Follower Team Via Linear Consensus (Q3523149) (← links)
- (Q3566722) (← links)
- On Constructor Rewrite Systems and the Lambda-Calculus (Q3638093) (← links)
- Proofs as Efficient Programs (Q3654818) (← links)
- (Q3787977) (← links)
- Complete logic programs with domain-closure axiom (Q3789103) (← links)
- An analysis of (linear) exponentials based on extended sequents (Q4221772) (← links)
- Categorical models for non-extensional λ-calculi and combinatory logic (Q4279260) (← links)
- A modal view of linear logic (Q4314678) (← links)
- (Q4842974) (← links)
- (Q4942005) (← links)
- (Q4963998) (← links)
- From 2-Sequents and Linear Nested Sequents to Natural Deduction for Normal Modal Logics (Q5034227) (← links)
- Coherence for sharing proof nets (Q5055862) (← links)
- An extension of system F with subtyping (Q5096247) (← links)
- (Optimal) duplication is not elementary recursive (Q5178845) (← links)
- Optimizing optimal reduction (Q5277747) (← links)
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks? (Q5375783) (← links)
- (Q5688812) (← links)
- Types for Proofs and Programs (Q5712304) (← links)
- Derivational Complexity Is an Invariant Cost Model (Q5747633) (← links)
- Logical Approaches to Computational Barriers (Q5898807) (← links)
- Cut Elimination for Extended Sequent Calculi (Q6200474) (← links)