The following pages link to Alexis Saurin (Q428893):
Displaying 29 items.
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Proof and refutation in MALL as a game (Q636305) (← links)
- Toward a curry-Howard equivalence for linear, reversible computation. Work-in-progress (Q2039895) (← links)
- Infinets: the parallel syntax for non-wellfounded proof-theory (Q2180524) (← links)
- PSPACE-completeness of a thread criterion for circular proofs in linear logic with least and greatest fixed points (Q2180526) (← links)
- Classical By-Need (Q2802497) (← links)
- (Q2852368) (← links)
- Classical Call-by-Need Sequent Calculi: The Unity of Semantic Artifacts (Q2900256) (← links)
- Typing streams in the Λμ-calculus (Q2946616) (← links)
- On the Dependencies of Logical Rules (Q2949457) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- On the Meaning of Focalization (Q3080087) (← links)
- From Focalization of Logic to the Logic of Focalization (Q3178251) (← links)
- On the Relations between the Syntactic Theories of λμ-Calculi (Q3540177) (← links)
- A Hierarchy for Delimited Continuations in Call-by-Name (Q3557863) (← links)
- Standardization and Böhm Trees for Λμ-Calculus (Q3558334) (← links)
- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic (Q3608427) (← links)
- Towards Completeness via Proof Search in the Linear Time μ-calculus (Q4635894) (← links)
- (Q4964689) (← links)
- (Q5079760) (← links)
- The fixed point property and a technique to harness double fixed point combinators (Q5213397) (← links)
- (Q5278431) (← links)
- (Q5351980) (← links)
- Towards Ludics Programming: Interactive Proof Search (Q5504660) (← links)
- A linear perspective on cut-elimination for non-wellfounded sequent calculi with least and greatest fixed-points (Q6541152) (← links)
- Decision problems for linear logic with least and greatest fixed points (Q6544115) (← links)
- Phase semantics for linear logic with least and greatest fixed points (Q6604652) (← links)
- A curry-Howard correspondence for linear, reversible computation (Q6610614) (← links)
- Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs (Q6649500) (← links)
