Pages that link to "Item:Q1225449"

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

Displayed 50 items.

• Proving the correctness of recursion-based automatic program transformations (Q671683) ‎ (← links)
• Computational interpretations of linear logic (Q685430) ‎ (← links)
• Using typed lambda calculus to implement formal systems on a machine (Q688571) ‎ (← links)
• Notions of computation and monads (Q757075) ‎ (← links)
• An abstract framework for environment machines (Q804281) ‎ (← links)
• Comparison of priority rules in pattern matching and term rewriting (Q808264) ‎ (← links)
• Call-by-push-value: Decomposing call-by-value and call-by-name (Q857915) ‎ (← links)
• Combining algebraic effects with continuations (Q879352) ‎ (← links)
• A syntactic correspondence between context-sensitive calculi and abstract machines (Q879356) ‎ (← links)
• A short proof of the lexical addressing algorithm (Q917326) ‎ (← links)
• Parametric \(\lambda \)-theories (Q930867) ‎ (← links)
• Types as graphs: Continuations in type logical grammar (Q1006443) ‎ (← links)
• A syntactic theory of sequential control (Q1101435) ‎ (← links)
• Decidability of the restriction equational theory in the partial lambda calculus (Q1120561) ‎ (← links)
• A mathematical semantics for a nondeterministic typed lambda-calculus (Q1152949) ‎ (← links)
• Inferring the equivalence of functional programs that mutate data (Q1196301) ‎ (← links)
• The revised report on the syntactic theories of sequential control and state (Q1199538) ‎ (← links)
• A theory for program and data type specification (Q1199933) ‎ (← links)
• LCF considered as a programming language (Q1243117) ‎ (← links)
• A syntactic theory of sequential state (Q1263961) ‎ (← links)
• Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) ‎ (← links)
• A behavioural theory of first-order CML (Q1285654) ‎ (← links)
• Synthesis of ML programs in the system Coq (Q1322847) ‎ (← links)
• Classical logic, storage operators and second-order lambda-calculus (Q1326769) ‎ (← links)
• A general storage theorem for integers in call-by-name \(\lambda\)- calculus (Q1329740) ‎ (← links)
• A constructive logic behind the catch and throw mechanism (Q1337695) ‎ (← links)
• Computational adequacy of the FIX-logic (Q1349677) ‎ (← links)
• A meta-language for typed object-oriented languages (Q1350339) ‎ (← links)
• Strong normalization from weak normalization in typed \(\lambda\)-calculi (Q1357009) ‎ (← links)
• A first order logic of effects (Q1390955) ‎ (← links)
• A general adequacy result for a linear functional language (Q1391860) ‎ (← links)
• A confluent calculus for concurrent constraint programming (Q1391935) ‎ (← links)
• On the strong normalisation of intuitionistic natural deduction with permutation-conversions (Q1400711) ‎ (← links)
• On the semantics of the call-by-name CPS transform (Q1575687) ‎ (← links)
• Actor languages. Their syntax, semantics, translation, and equivalence (Q1575845) ‎ (← links)
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) ‎ (← links)
• Game semantics and linear CPS interpretation (Q1770417) ‎ (← links)
• Axioms for strict and lazy functional programs (Q1772783) ‎ (← links)
• About classical logic and imperative programming (Q1817076) ‎ (← links)
• An interpretation of \(\lambda \mu\)-calculus in \(\lambda\)-calculus. (Q1853149) ‎ (← links)
• Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus (Q1853595) ‎ (← links)
• Relational interpretations of recursive types in an operational setting. (Q1854316) ‎ (← links)
• Perpetuality and uniform normalization in orthogonal rewrite systems (Q1854401) ‎ (← links)
• Assigning types to processes (Q1854525) ‎ (← links)
• Conservation and uniform normalization in lambda calculi with erasing reductions (Q1854562) ‎ (← links)
• The origins of structural operational semantics (Q1878710) ‎ (← links)
• Games characterizing Levy-Longo trees (Q1884875) ‎ (← links)
• A first-order one-pass CPS transformation (Q1884883) ‎ (← links)
• Parametric parameter passing \(\lambda\)-calculus (Q1887148) ‎ (← links)
• On the call-by-value CPS transform and its semantics (Q1887170) ‎ (← links)