Pages that link to "Item:Q801050"

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

Displaying 50 items.

• The Prismoid of Resources (Q3182947) (← links)
• A General Class of Models of $\mathcal{H}^*$ (Q3182956) (← links)
• A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types (Q3184667) (← links)
• A Complete, Co-inductive Syntactic Theory of Sequential Control and State (Q3184753) (← links)
• Automath Type Inclusion in Barendregt’s Cube (Q3194722) (← links)
• Lambda-calcul, évaluation paresseuse et mise en mémoire (Q3204440) (← links)
• A Type Theory for Probabilistic $$\lambda $$–calculus (Q3297838) (← links)
• (Q3300788) (← links)
• Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus:A Survey (Q3305634) (← links)
• (Q3384877) (← links)
• BUNDER’S PARADOX (Q3389494) (← links)
• Proceeding in Abstraction. From Concepts to Types and the Recent Perspective on Information (Q3401360) (← links)
• Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices (Q3453110) (← links)
• Regular Patterns in Second-Order Unification (Q3454122) (← links)
• The Role of Indirections in Lazy Natural Semantics (Q3455082) (← links)
• Call-by-Value Non-determinism in a Linear Logic Type Discipline (Q3455843) (← links)
• (Q3483291) (← links)
• On Normalization by Evaluation for Object Calculi (Q3499758) (← links)
• Inter-deriving Semantic Artifacts for Object-Oriented Programming (Q3511441) (← links)
• Computation with classical sequents (Q3520146) (← links)
• An insertion operator preserving infinite reduction sequences (Q3520149) (← links)
• Safety of Nöcker's strictness analysis (Q3520168) (← links)
• (Q3522248) (← links)
• Graph lambda theories (Q3535680) (← links)
• Measurement-Based and Universal Blind Quantum Computation (Q3575028) (← links)
• ASMs and Operational Algorithmic Completeness of Lambda Calculus (Q3586009) (← links)
• An Introduction to the Lambda Calculus (Q3599178) (← links)
• Abstract λ-Calculus Machines (Q3599179) (← links)
• A Relational Model of a Parallel and Non-deterministic λ-Calculus (Q3605523) (← links)
• First-class patterns (Q3616447) (← links)
• Local Termination (Q3636830) (← links)
• Relating Classical Realizability and Negative Translation for Existential Witness Extraction (Q3637195) (← links)
• A Polymorphic Type System for the Lambda-Calculus with Constructors (Q3637198) (← links)
• A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy (Q3637270) (← links)
• Effective λ-models versus recursively enumerable λ-theories (Q3643360) (← links)
• Typed Applicative Structures and Normalization by Evaluation for System F ω (Q3644739) (← links)
• The λ-calculus with constructors: Syntax, confluence and separation (Q3644936) (← links)
• Complete Types in an Extension of the System <i>AF</i>2 (Q3647204) (← links)
• SUBSEXPL: a tool for simulating and comparing explicit substitutions calculi ★ (Q3647258) (← links)
• Logic and functional programming by retractions (Q3817574) (← links)
• Rétractions et interprétation interne du polymorphisme : le problème de la rétraction universelle (Q3991293) (← links)
• Provable isomorphisms of types (Q4017461) (← links)
• (Q4222932) (← links)
• The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) (← links)
• Building domains from graph models (Q4279258) (← links)
• Categorical models for non-extensional λ-calculi and combinatory logic (Q4279260) (← links)
• An application of PER models to program extraction (Q4282806) (← links)
• Simulating expansions without expansions (Q4322432) (← links)
• Pure type systems with more liberal rules (Q4328821) (← links)
• Toward a semantics for the QUEST language (Q4365022) (← links)