The following pages link to Term Rewriting and Applications (Q5703851):
Displaying 23 items.
- Semantics of higher-order quantum computation via geometry of interaction (Q345711) (← links)
- Quantum implicit computational complexity (Q1044836) (← links)
- Needed reduction and spine strategies for the lambda calculus (Q1097253) (← links)
- Factorization in call-by-name and call-by-value calculi via linear logic (Q2233405) (← links)
- Reduction and introducers in \(d\)-contexts (Q2294543) (← links)
- Confluence in probabilistic rewriting (Q2333318) (← links)
- A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG (Q2493750) (← links)
- Confluence results for a quantum lambda calculus with measurements (Q2825377) (← links)
- Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
- (Q4521592) (← links)
- (Q4723273) (← links)
- Refining reduction in the lambda calculus (Q4880488) (← links)
- Reducibility Proofs in the λ-Calculus (Q4903716) (← links)
- (Q4953356) (← links)
- lambda!-calculus, Intersection Types, and Involutions (Q5089015) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- Optimality and the linear substitution calculus (Q5111304) (← links)
- (Q5224689) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Processes, Terms and Cycles: Steps on the Road to Infinity (Q5898158) (← links)
- Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic (Q6137846) (← links)
- Exponentials as substitutions and the cost of cut elimination in linear logic (Q6649484) (← links)
