Pages that link to "Item:Q4744243"
From MaRDI portal
The following pages link to What is a model of the lambda calculus? (Q4744243):
Displayed 32 items.
- Computability in higher types, P\(\omega\) and the completeness of type assignment (Q579245) (← links)
- Lambda abstraction algebras: representation theorems (Q674002) (← links)
- Extensional models for polymorphism (Q749518) (← links)
- The semantics of second-order lambda calculus (Q751294) (← links)
- On combinatory algebras and their expansions (Q760416) (← links)
- Completeness of type assignment in continuous lambda models (Q792995) (← links)
- Kripke-style models for typed lambda calculus (Q804559) (← links)
- A category-theoretic characterization of functional completeness (Q912587) (← links)
- Functional programming with combinators (Q1098628) (← links)
- Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936) (← links)
- Polymorphic type inference and containment (Q1110312) (← links)
- Enlargements of functional algebras for the lambda calculus (Q1129261) (← links)
- Inheritance as implicit coercion (Q1175335) (← links)
- Quantitative domains and infinitary algebras (Q1185015) (← links)
- Infinite \(\lambda\)-calculus and types (Q1275621) (← links)
- A finite equational axiomatization of the functional algebras for the lambda calculus (Q1283777) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- An algebraic semantics of higher-order types with subtypes (Q1323318) (← links)
- Proof-functional connectives and realizability (Q1330311) (← links)
- On the algebraic models of lambda calculus (Q1583488) (← links)
- Can LCF be topped! Flat lattice models of typed \(\lambda{}\)-calculus (Q1813498) (← links)
- Representation of varieties in combinatory algebras (Q1821805) (← links)
- A relative PCF-definability result for strongly stable functions and some corollaries (Q1854294) (← links)
- A note on the proof theory of the \(\lambda \Pi\)-calculus (Q1891931) (← links)
- The abstract variable-binding calculus (Q1896759) (← links)
- Easy lambda-terms are not always simple (Q2889181) (← links)
- A Filter Model for the λμ-Calculus (Q3007668) (← links)
- The interpretation of unsolvable <i>λ</i>-terms in models of untyped <i>λ</i>-calculus (Q4254697) (← links)
- (Q4513578) (← links)
- Type inference with simple subtypes (Q4939703) (← links)
- On the construction of stable models of untyped \(\lambda\)-calculus (Q5958611) (← links)