Infinitary lambda calculus

DOI10.1016/S0304-3975(96)00171-5zbMath0903.68105OpenAlexW1968168625MaRDI QIDQ1392145

Jan Willem Klop, J. R. Kennaway, M. R. Sleep, Fer-Jan de Vries

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00171-5

zbMATH Keywords

lambda calculusorthogonal term rewriting systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (43)

Infinitary lambda calculus and discrimination of Berarducci trees. ⋮ Adapting innocent game models for the Böhm tree \(\lambda\)-theory ⋮ Confluence of the coinductive \(\lambda\)-calculus ⋮ Limiting partial combinatory algebras ⋮ Unnamed Item ⋮ Productivity of stream definitions ⋮ Non-linearity as the Metric Completion of Linearity ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lambda calculus with explicit recursion ⋮ Highlights in infinitary rewriting and lambda calculus ⋮ Infinitary lambda calculus ⋮ Cost Automata, Safe Schemes, and Downward Closures ⋮ Counterexamples in infinitary rewriting with non-fully-extended rules ⋮ Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications ⋮ Böhm theorem and Böhm trees for the \(\varLambda \mu\)-calculus ⋮ On Normalisation of Infinitary Combinatory Reduction Systems ⋮ A Light Modality for Recursion ⋮ Term graph rewriting ⋮ From Böhm's Theorem to Observational Equivalences ⋮ Substitution in non-wellfounded syntax with variable binding ⋮ Infinitary combinatory reduction systems ⋮ On modularity in infinitary term rewriting ⋮ Unnamed Item ⋮ Intersection types for \(\lambda\)-trees ⋮ Innocent game models of untyped \(\lambda\)-calculus ⋮ Polynomial time over the reals with parsimony ⋮ Types for Hereditary Head Normalizing Terms ⋮ Coinductive big-step operational semantics ⋮ Comparing Böhm-Like Trees ⋮ Applications of infinitary lambda calculus ⋮ Completeness and Herbrand theorems for nominal logic ⋮ Infinite \(\lambda\)-calculus and types ⋮ A finite equational axiomatization of the functional algebras for the lambda calculus ⋮ Böhm Reduction in Infinitary Term Graph Rewriting Systems ⋮ On the algebraic models of lambda calculus ⋮ Skew confluence and the lambda calculus with letrec ⋮ Encoding many-valued logic in $\lambda$-calculus ⋮ Descendants and origins in term rewriting. ⋮ Infinitary affine proofs ⋮ The infinitary lambda calculus of the infinite eta Böhm trees ⋮ Clocked lambda calculus ⋮ On the complexity of stream equality

Cites Work

• The lambda calculus. Its syntax and semantics. Rev. ed.
• Full abstraction in the lazy lambda calculus
• Infinitary lambda calculus
• Sequential evaluation strategies for parallel-or and related reduction systems
• Transfinite reductions in orthogonal term rewriting systems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinitary lambda calculus