The ant-lion paradigm for strong normalization

DOI10.1006/INCO.1994.1079MaRDI QIDQ1336047zbMATH OpenOpenAlexFDO

Authors Benedetto Intrigila, Corrado Böhm

Publication date 20 November 1994

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/inco.1994.1079

zbMATH Keywords

fixed-point equationsadequacy theorem for numeral systemsstrongly normalizable solution

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• Strong normalization from an unusual point of view
• scientific article; zbMATH DE number 512779
• A simple proof of the undecidability of strong normalisation
• Strong normalisation for applied lambda calculi
• An Arithmetical Proof of the Strong Normalization for the λ-Calculus with Recursive Equations on Types

Cited in

(7)

• Conservation and uniform normalization in lambda calculi with erasing reductions
• Perpetuality and uniform normalization in orthogonal rewrite systems
• Orders, reduction graphs and spectra
• Taming the wild ant-lion; a counterexample to a conjecture of Böhm
• Some results on numerical systems in \(\lambda\)-calculus
• On the longest perpetual reductions in orthogonal expression reduction systems
• Semantical analysis of perpetual strategies in -calculus

This page was built for publication: The ant-lion paradigm for strong normalization

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