The following pages link to (Q4449226):
Displaying 16 items.
- Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus (Q428894) (← links)
- Hypersequent calculi for intuitionistic logic with classical atoms (Q636282) (← links)
- A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) (← links)
- A type-theoretic foundation of delimited continuations (Q968364) (← links)
- Undecidability of the problem of recognizing axiomatizations of superintuitionistic propositional calculi (Q2259003) (← links)
- A proof-theoretic foundation of abortive continuations (Q2464725) (← links)
- Linearity, Control Effects, and Behavioral Types (Q2988641) (← links)
- Classical Call-by-Need and Duality (Q3007655) (← links)
- A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
- (Q4957790) (← links)
- Programming and Proving with Classical Types (Q5055999) (← links)
- (Q5111325) (← links)
- Deriving Natural Deduction Rules from Truth Tables (Q5224496) (← links)
- Normalization in the simply typed -calculus (Q5889885) (← links)
- Proof Terms for Generalized Natural Deduction (Q6060674) (← links)
- Adding Negation to Lambda Mu (Q6135761) (← links)
