NP-completeness of a combinator optimization problem

DOI10.1305/NDJFL/1040248462zbMath0837.03015OpenAlexW2091336525MaRDI QIDQ1903594

M. S. Joy, V. J. Rayward-Smith

Publication date: 13 May 1996

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

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

zbMATH Keywords

normal formNP-completecombinatory logicdeterministic rewrite systemlambda- expression

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Metaheuristics: A bibliography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatory logic. With two sections by William Craig.
• The lambda calculus, its syntax and semantics
• Combinatory logic. Vol. II
• A new implementation technique for applicative languages
• Another algorithm for bracket abstraction

This page was built for publication: NP-completeness of a combinator optimization problem