Pages that link to "Item:Q801050"
From MaRDI portal
The following pages link to The lambda calculus. Its syntax and semantics. Rev. ed. (Q801050):
Displaying 50 items.
- Lazy variable-renumbering makes substitution cheap (Q1114386) (← links)
- Equivalence of bar recursors in the theory of functionals of finite type (Q1115867) (← links)
- Unique normal forms for lambda calculus with surjective pairing (Q1117204) (← 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)
- Generalization from partial parametrization in higher-order type theory (Q1122980) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- A lambda-calculus for dynamic binding (Q1127514) (← links)
- A decidable canonical representation of the compact elements in Scott's reflexive domain in \(P\omega\) (Q1127535) (← links)
- Domain theory in logical form (Q1174593) (← links)
- Polymorphic rewriting conserves algebraic strong normalization (Q1176244) (← links)
- A list-oriented extension of the lambda-calculus satisfying the Church-Rosser theorem (Q1185009) (← links)
- Filter models with polymorphic types (Q1186431) (← links)
- An algebraic model of synchronous systems (Q1186811) (← links)
- Conditional rewriting logic as a unified model of concurrency (Q1190488) (← links)
- Complete restrictions of the intersection type discipline (Q1193654) (← links)
- Fairness, distances and degrees (Q1193862) (← links)
- On the adequacy of representing higher order intuitionistic logic as a pure type system (Q1194249) (← links)
- Confluence of the lambda calculus with left-linear algebraic rewriting (Q1197987) (← links)
- An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus (Q1198661) (← links)
- The systematic construction of a one-combinator basis for lambda-terms (Q1203131) (← links)
- Adding algebraic rewriting to the untyped lambda calculus (Q1207945) (← links)
- Capturing strong reduction in director string calculus (Q1208420) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- Full abstractness for a functional/concurrent language with higher-order value-passing (Q1271466) (← links)
- Diagram techniques for confluence (Q1271472) (← links)
- Reaction graph (Q1273068) (← links)
- Structures definable in polymorphism (Q1273075) (← links)
- A conservative look at operational semantics with variable binding (Q1273877) (← links)
- An algebraic generalization of Frege structures -- binding algebras (Q1274449) (← links)
- Semantical analysis of perpetual strategies in \(\lambda\)-calculus (Q1275628) (← links)
- Orders, reduction graphs and spectra (Q1275630) (← links)
- An algebraic view of the Böhm-out technique (Q1275631) (← links)
- On functions preserving levels of approximation: A refined model construction for various lambda calculi (Q1275633) (← links)
- Decidability of behavioural equivalence in unary PCF (Q1285665) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Typability and type checking in System F are equivalent and undecidable (Q1302292) (← links)
- On \(\Pi\)-conversion in the \(\lambda\)-cube and the combination with abbreviations (Q1302298) (← links)
- Type inference, abstract interpretation and strictness analysis (Q1314350) (← links)
- Combinatory reduction systems: Introduction and survey (Q1314356) (← links)
- A type-theoretical alternative to ISWIM, CUCH, OWHY (Q1314363) (← links)
- Combining type disciplines (Q1319505) (← links)
- An internal language for autonomous categories (Q1320337) (← links)
- Confluence by decreasing diagrams (Q1322164) (← links)
- \(F\)-semantics for type assignment systems (Q1329739) (← links)
- Proof-functional connectives and realizability (Q1330311) (← links)
- Embedding \(\omega\)-continuous posets in function spaces of domains (Q1333186) (← links)
- Eta-conversion for the languages of explicit substitutions (Q1335136) (← links)
- Semantics of weakening and contraction (Q1337357) (← links)
- Reduction and unification in lambda calculi with a general notion of subtype (Q1340967) (← links)
