Pages that link to "Item:Q1050334"

The following pages link to Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms (Q1050334):

Displayed 43 items.

• Graph easy sets of mute lambda terms (Q288793) ‎ (← links)
• Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) ‎ (← links)
• Type inference with recursive types: Syntax and semantics (Q756435) ‎ (← links)
• On combinatory algebras and their expansions (Q760416) ‎ (← links)
• A category-theoretic characterization of functional completeness (Q912587) ‎ (← links)
• On the observational theory of the CPS-calculus (Q968276) ‎ (← links)
• Applications of infinitary lambda calculus (Q1021568) ‎ (← links)
• A characterization of F-complete type assignments (Q1089331) ‎ (← links)
• On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory (Q1120558) ‎ (← links)
• A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\) (Q1127535) ‎ (← links)
• Finite type structures within combinatory algebras (Q1182485) ‎ (← links)
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) ‎ (← links)
• Infinite \(\lambda\)-calculus and types (Q1275621) ‎ (← links)
• Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) ‎ (← links)
• On reduction-based process semantics (Q1350347) ‎ (← links)
• On the semantics of the call-by-name CPS transform (Q1575687) ‎ (← links)
• From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) ‎ (← links)
• A computable expression of closure to efficient causation (Q1617623) ‎ (← links)
• Semantics for dual and symmetric combinatory calculi (Q1826434) ‎ (← links)
• Building continuous webbed models for system F (Q1826624) ‎ (← links)
• Discrimination by parallel observers: the algorithm. (Q1854269) ‎ (← links)
• Infinitary lambda calculus and discrimination of Berarducci trees. (Q1874272) ‎ (← links)
• Games characterizing Levy-Longo trees (Q1884875) ‎ (← links)
• Highlights in infinitary rewriting and lambda calculus (Q1929230) ‎ (← links)
• Eager functions as processes (Q2123050) ‎ (← links)
• A curry-style semantics of interaction: from untyped to second-order lazy \(\lambda\mu\)-calculus (Q2200839) ‎ (← links)
• Easiness in graph models (Q2368937) ‎ (← links)
• Easy lambda-terms are not always simple (Q2889181) ‎ (← links)
• Isomorphisms and nonisomorphisms of graph models (Q3360838) ‎ (← links)
• Graph lambda theories (Q3535680) ‎ (← links)
• Comparing Böhm-Like Trees (Q3636829) ‎ (← links)
• Effective λ-models versus recursively enumerable λ-theories (Q3643360) ‎ (← links)
• The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) ‎ (← links)
• (Q4580329) ‎ (← links)
• From Böhm's Theorem to Observational Equivalences (Q4916172) ‎ (← links)
• (Q4993334) ‎ (← links)
• (Q5109521) ‎ (← links)
• Lazy Lambda calculus: Theories, models and local structure characterization (Q5204341) ‎ (← links)
• The infinitary lambda calculus of the infinite eta Böhm trees (Q5269002) ‎ (← links)
• Intersection types for \(\lambda\)-trees (Q5958291) ‎ (← links)
• Algebraic interpretation of lambda calculus with resources (Q6162097) ‎ (← links)
• Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications (Q6178717) ‎ (← links)
• Sets with structure, mappings and fixed point property: fixed point structures (Q6180625) ‎ (← links)