The following pages link to Delia Kesner (Q654905):
Displaying 50 items.
- A prismoid framework for languages with resources (Q654907) (← links)
- On abstract normalisation beyond neededness (Q683744) (← links)
- Resource operators for \(\lambda\)-calculus (Q876041) (← links)
- \(\lambda\)-calculi with explicit substitutions preserving strong normalization (Q1290510) (← links)
- Combining algebraic rewriting, extensional lambda calculi, and fixpoints (Q1349901) (← links)
- (Q1575246) (redirect page) (← links)
- Confluence of extensional and non-extensional \(\lambda\)-calculi with explicit substitutions (Q1575247) (← links)
- Call-by-need, neededness and all that (Q1652986) (← links)
- Strong normalization through intersection types and memory (Q1744407) (← links)
- Pattern matching as cut elimination (Q1882898) (← links)
- A typed pattern calculus (Q1908354) (← links)
- The bang calculus revisited (Q2039931) (← links)
- The spirit of node replication (Q2233421) (← links)
- Expression reduction systems with patterns (Q2467565) (← links)
- (Q2723891) (← links)
- (Q2778870) (← links)
- A Resource Aware Computational Interpretation for Herbelin’s Syntax (Q2787437) (← links)
- Reasoning About Call-by-need by Means of Types (Q2811356) (← links)
- Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus (Q2881096) (← links)
- The Permutative λ-Calculus (Q2891437) (← links)
- λ-calculi with explicit substitutions and composition which preserve β-strong normalization (Q2956728) (← links)
- (Q2978530) (← links)
- The Prismoid of Resources (Q3182947) (← links)
- Quantitative Types for the Linear Substitution Calculus (Q3190169) (← links)
- The Inhabitation Problem for Non-idempotent Intersection Types (Q3190172) (← links)
- de Bruijn Indices for Metaterms (Q3371148) (← links)
- Relating Higher-order and First-order Rewriting (Q3371149) (← links)
- A Theory of Explicit Substitutions with Safe and Full Composition (Q3395095) (← links)
- Perpetuality for Full and Safe Composition (in a Constructive Setting) (Q3519510) (← links)
- The Structural λ-Calculus (Q3586054) (← links)
- The Theory of Calculi with Explicit Substitutions Revisited (Q3608416) (← links)
- Strong Cut-Elimination Systems for Hudelmaier’s Depth-Bounded Sequent Calculus for Implicational Logic (Q3613419) (← links)
- First-class patterns (Q3616447) (← links)
- (Q4035249) (← links)
- (Q4217940) (← links)
- (Q4259961) (← links)
- (Q4264714) (← links)
- Simulating expansions without expansions (Q4322432) (← links)
- (Q4447226) (← links)
- (Q4506392) (← links)
- (Q4508294) (← links)
- (Q4537518) (← links)
- A resource aware semantics for a focused intuitionistic calculus (Q4559602) (← links)
- (Q4580327) (← links)
- A confluent reduction for the extensional typed λ-calculus with pairs, sums, recursion and terminal object (Q4630299) (← links)
- Combining first order algebraic rewriting systems, recursion and extensional lambda calculi (Q4632448) (← links)
- Non-idempotent intersection types for the Lambda-Calculus (Q4644585) (← links)
- Proof nets and explicit substitutions (Q4814187) (← links)
- Confluence properties of extensional and non-extensional λ-calculi with explicit substitutions (extended abstract) (Q5055860) (← links)
- (Q5111320) (← links)
