The following pages link to Call-by-Value -calculus and LJQ (Q5441124):
Displaying 18 items.
- A short proof that adding some permutation rules to \(\beta \) preserves SN (Q631758) (← links)
- System \(T\), call-by-value and the minimum problem (Q1274979) (← links)
- A semantic framework for proof evidence (Q1701039) (← links)
- Proof checking and logic programming (Q2628296) (← links)
- The Value-Passing Calculus (Q2842635) (← links)
- Open Call-by-Value (Q3179293) (← links)
- (Q4448358) (← links)
- (Q4499189) (← links)
- (Q4600771) (← links)
- The call-by-value λ-calculus: a semantic investigation (Q4719353) (← links)
- (Q4986734) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- Standardization of a Call-By-Value Lambda-Calculus (Q5277841) (← links)
- Monadic translation of classical sequent calculus (Q5410235) (← links)
- Term Rewriting and Applications (Q5703850) (← links)
- Proof Checking and Logic Programming (Q5743582) (← links)
- Logical Approaches to Computational Barriers (Q5898815) (← links)
- Strong call-by-value and multi types (Q6605354) (← links)