The following pages link to Delia Kesner (Q654905):
Displaying 19 items.
- (Q5111900) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- Consuming and Persistent Types for Classical Logic (Q5145668) (← links)
- (Q5208874) (← links)
- Observability for Pair Pattern Calculi (Q5277835) (← links)
- A nonstandard standardization theorem (Q5408457) (← links)
- Term Rewriting and Applications (Q5703866) (← links)
- (Q5856410) (← links)
- (Q5874189) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898167) (← links)
- Programming Languages and Systems (Q5899011) (← links)
- (Q6079229) (← links)
- The bang calculus revisited (Q6116183) (← links)
- (Q6124962) (← links)
- Node Replication: Theory And Practice (Q6192004) (← links)
- Solvability for generalized applications (Q6544113) (← links)
- Rewriting with extensional polymorphic \(\lambda \)-calculus (Q6560170) (← links)
- A strong bisimulation for a classical term calculus (Q6563051) (← links)
- A faithful and quantitative notion of distant reduction for the lambda-calculus with generalized applications (Q6597960) (← links)