The following pages link to A reflection on call-by-value (Q2817680):
Displaying 11 items.
- Open Call-by-Value (Q3179293) (← links)
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (Q3637192) (← links)
- Monadic Translation of Intuitionistic Sequent Calculus (Q3638248) (← links)
- Trace-Relating Compiler Correctness and Secure Compilation (Q5041085) (← links)
- Relating Functional and Imperative Session Types (Q5043592) (← links)
- A Functional Abstraction of Typed Invocation Contexts (Q5043596) (← links)
- ANF preserves dependent types up to extensional equality (Q5051989) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- How to prove decidability of equational theories with second-order computation analyser SOL (Q5110922) (← links)
- On reduction and normalization in the computational core (Q5879269) (← links)
- Galois connecting call-by-value and call-by-name (Q6151562) (← links)
