The following pages link to λμ-calculus and Böhm's theorem (Q2732290):
Displayed 14 items.
- Applicative bisimilarities for call-by-name and call-by-value \(\lambda\mu\)-calculus (Q283739) (← links)
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- The relational model is injective for multiplicative exponential linear logic (without weakenings) (Q435194) (← links)
- A type-theoretic foundation of delimited continuations (Q968364) (← links)
- Polarized proof-nets and \(\lambda \mu\)-calculus (Q1853586) (← links)
- Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus (Q1853595) (← links)
- The differential \(\lambda \mu\)-calculus (Q2373711) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- A Filter Model for the λμ-Calculus (Q3007668) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (Q3637192) (← links)
- (Q4611381) (← links)
- The approximation theorem for the Λμ-calculus (Q5268997) (← links)
- Call-by-name extensionality and confluence (Q5372008) (← links)