Strict ideal completions of the lambda calculus

DOI10.4230/LIPICS.FSCD.2018.8MaRDI QIDQ4993334zbMATH OpenFDO

Authors Patrick Bahr

Publication date 15 June 2021

Full work available at URL https://arxiv.org/abs/1805.06736

zbMATH Keywords

Böhm treesconfluenceinfinitary rewritinglambda calculusmeaningless terms

Mathematics Subject Classification ID

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

Recommendations

• Rewriting Techniques and Applications
• The infinitary lambda calculus of the infinite eta Böhm trees
• Infinitary lambda calculi from a linear perspective
• Infinitary lambda calculus
• An infinitary affine lambda-calculus isomorphic to the full lambda-calculus

Cites work

• Abstract models of transfinite reductions
• scientific article; zbMATH DE number 3709584 (Why is no real title available?)
• scientific article; zbMATH DE number 1332646 (Why is no real title available?)
• Infinitary term graph rewriting is simple, sound and complete
• Metric completion versus ideal completion
• Partial order infinitary term rewriting and Böhm trees
• Rewriting Techniques and Applications
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms

Cited in

(7)

• An infinitary affine lambda-calculus isomorphic to the full lambda-calculus
• Completeness of transfinite evaluation in an extension of the lambda calculus
• Infinitary lambda calculi and böhm models
• Sequence types for hereditary permutators
• A new coinductive confluence proof for infinitary lambda calculus
• Typed Lambda Calculi and Applications
• Rewriting Techniques and Applications

This page was built for publication: Strict ideal completions of the lambda calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993334)