Pages that link to "Item:Q801050"

The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):

Displaying 50 items.

• On a monadic semantics for freshness (Q2566026) (← links)
• Weak linearization of the lambda calculus (Q2566028) (← links)
• Compositional characterisations of \(\lambda\)-terms using intersection types (Q2566033) (← links)
• Remarks on applicative theories (Q2566067) (← links)
• The conflict-free reduction geometry (Q2581368) (← links)
• Kernel-LEAF: A logic plus functional language (Q2638759) (← links)
• Towards a homotopy domain theory (Q2700838) (← links)
• Domain-free \(\lambda\mu\)-calculus (Q2729625) (← links)
• The \(I\)-types of system \(\mathcal F\) (Q2773020) (← links)
• An Interaction Net Encoding of Gödel’s System  $$\mathcal {T}$$ (Q2798262) (← links)
• Classical By-Need (Q2802497) (← links)
• The mechanisation of Barendregt-style equational proofs (the residual perspective) (Q2841232) (← links)
• Developing (meta)theory of \(\lambda\)-calculus in the theory of contexts (Q2841233) (← links)
• The theory of contexts for first order and higher order abstract syntax (Q2841274) (← links)
• Comparing higher-order encodings in logical frameworks and tile logic (Q2841275) (← links)
• Strongly normalising cut-elimination with strict intersection types (Q2842832) (← links)
• Reducibility: a ubiquitous method in lambda calculus with intersection types (Q2842839) (← links)
• Intersection typed \(\lambda \)-calculus (Q2842843) (← links)
• Rewriting calculus with(out) types (Q2851046) (← links)
• Nominal equational logic (Q2864152) (← links)
• Term collections in {\(\lambda\)} and {\(\rho\)}-calculi (Q2864209) (← links)
• From functional programs to interaction nets via the rewriting calculus (Q2864528) (← links)
• Local bigraphs and confluence: two conjectures (extended abstract) (Q2866344) (← links)
• Sub-\(\lambda\)-calculi, classified (Q2870319) (← links)
• Complete laziness: a natural semantics (Q2873681) (← links)
• Computational soundness of a call by name calculus of recursively-scoped records (Q2873682) (← links)
• Minimality in a linear calculus with iteration (Q2873683) (← links)
• What is a categorical model of the differential and the resource \(\lambda \)-calculi? (Q2888856) (← links)
• Easy lambda-terms are not always simple (Q2889181) (← links)
• Sharing in the Graph Rewriting Calculus (Q2890320) (← links)
• Rewriting Strategies and Strategic Rewrite Programs (Q2945718) (← links)
• Lambda theories allowing terms with a finite number of fixed points (Q2973253) (← links)
• Metric Reasoning About $$\lambda $$-Terms: The General Case (Q2988646) (← links)
• Three Syntactic Theories for Combinatory Graph Reduction (Q3003482) (← links)
• Classical Call-by-Need and Duality (Q3007655) (← links)
• Game Semantics and Uniqueness of Type Inhabitance in the Simply-Typed λ-Calculus (Q3007657) (← links)
• Böhm’s Theorem for Resource Lambda Calculus through Taylor Expansion (Q3007664) (← links)
• A Filter Model for the λμ-Calculus (Q3007668) (← links)
• Approximation Semantics and Expressive Predicate Assignment for Object-Oriented Programming (Q3007669) (← links)
• Structural recursion with locally scoped names (Q3016213) (← links)
• (Q3077958) (← links)
• Mechanised Computability Theory (Q3088013) (← links)
• The λ-calculus in the π-calculus (Q3094164) (← links)
• Intersection Types for the Resource Control Lambda Calculi (Q3105748) (← links)
• Automorphisms of types in certain type theories and representation of finite groups (Q3119463) (← links)
• λν, a calculus of explicit substitutions which preserves strong normalisation (Q3125228) (← links)
• A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
• Binding in Nominal Equational Logic (Q3178258) (← links)
• New (Q3178271) (← links)
• A Realizability Interpretation for Intersection and Union Types (Q3179292) (← links)