Pages that link to "Item:Q1225449"

The following pages link to Call-by-name, call-by-value and the \(\lambda\)-calculus (Q1225449):

Displayed 48 items.

• Variations on mobile processes (Q1960530) ‎ (← links)
• Game-theoretic analysis of call-by-value computation (Q1960532) ‎ (← links)
• Intersection types and lambda models (Q2369008) ‎ (← links)
• State-transition machines for lambda-calculus expressions (Q2464714) ‎ (← links)
• Axioms for control operators in the CPS hierarchy (Q2464730) ‎ (← links)
• A static simulation of dynamic delimited control (Q2464731) ‎ (← links)
• On the unity of duality (Q2482843) ‎ (← links)
• Completeness of continuation models for \(\lambda_\mu\)-calculus (Q2506496) ‎ (← links)
• A functional correspondence between monadic evaluators and abstract machines for languages with computational effects (Q2566031) ‎ (← links)
• Order-enriched categorical models of the classical sequent calculus (Q2576913) ‎ (← links)
• A structural approach to reversible computation (Q2581367) ‎ (← links)
• Domain-Free<i>λµ</i>-Calculus (Q2729625) ‎ (← links)
• European Summer Meeting of the Association for Symbolic Logic, Hull, 1986 (Q3030791) ‎ (← links)
• Mechanized Verification of CPS Transformations (Q3498467) ‎ (← links)
• Safety of Nöcker's strictness analysis (Q3520168) ‎ (← links)
• A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case (Q3522027) ‎ (← links)
• Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence (Q3540198) ‎ (← links)
• Quantifiers in Japanese (Q3623834) ‎ (← links)
• A Process-Model for Linear Programs (Q3638259) ‎ (← links)
• Meeting of the Association for Symbolic Logic, Stanford, California, 1985 (Q3755421) ‎ (← links)
• Functions as processes (Q4017458) ‎ (← links)
• (Q4157924) ‎ (← links)
• Representing Control: a Study of the CPS Transformation (Q4279251) ‎ (← links)
• From operational semantics to abstract machines (Q4279254) ‎ (← links)
• Comprehending monads (Q4279255) ‎ (← links)
• Fully abstract translations between functional languages (Q4286526) ‎ (← links)
• The Impact of the Lambda Calculus in Logic and Computer Science (Q4359526) ‎ (← links)
• A new deconstructive logic: linear logic (Q4372906) ‎ (← links)
• Proofs of strong normalisation for second order classical natural deduction (Q4382485) ‎ (← links)
• Representing Control: a Study of the CPS Transformation (Q4493071) ‎ (← links)
• (Q4510742) ‎ (← links)
• Strong normalization proof with CPS-translation for second order classical natural deduction (Q4650260) ‎ (← links)
• (Q4668854) ‎ (← links)
• A categorical understanding of environment machines (Q4763978) ‎ (← links)
• Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis^† (Q4880526) ‎ (← links)
• Sound and complete axiomatisations of call-by-value control operators (Q4882487) ‎ (← links)
• Reference counting as a computational interpretation of linear logic (Q4895551) ‎ (← links)
• Formal basis for the refinement of rule based transition systems (Q4895556) ‎ (← links)
• A partial evaluator for the untyped lambda-calculus (Q4939696) ‎ (← links)
• Equivalence in functional languages with effects (Q4939702) ‎ (← links)
• Call-by-value Solvability (Q4953339) ‎ (← links)
• On one-pass CPS transformations (Q5428374) ‎ (← links)
• On categorical models of classical logic and the Geometry of Interaction (Q5430139) ‎ (← links)
• Operational interpretations of an extension of F_ω with control operators (Q5687907) ‎ (← links)
• On the semantics of classical disjunction (Q5939825) ‎ (← links)
• Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models (Q5958296) ‎ (← links)
• Weak normalization implies strong normalization in a class of non-dependent pure type systems (Q5958619) ‎ (← links)
• An induction principle for pure type systems (Q5958776) ‎ (← links)