A property which guarantees termination in weak combinatory logic and subtree replacement systems

DOI10.1305/NDJFL/1093883514zbMath0416.03015OpenAlexW1965871469MaRDI QIDQ754175

Alberto Pettorossi

Publication date: 1981

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093883514

zbMATH Keywords

subtree replacement systemstermination in weak combinatory logic

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Turing machines and related notions (03D10) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Termination of rewriting

This page was built for publication: A property which guarantees termination in weak combinatory logic and subtree replacement systems