c-Machine with -reduction

DOI10.1016/S0304-3975(97)00040-6zbMATH Open0903.68111MaRDI QIDQ1389686FDOQ1389686

Authors: Mohamed Mezghiche 

Publication date: 30 June 1998

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

Recommendations

• Une nouvelle C\(\beta\)-réduction dans la logique combinatoire
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.
• On pseudo-c\(\beta\) normal form in combinatory logic

zbMATH Keywords

functional programming languages\(\lambda \beta\)-Reduction\(c\beta\)-Reductioncombinatory reduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• On pseudo-c\(\beta\) normal form in combinatory logic
• Une nouvelle C\(\beta\)-réduction dans la logique combinatoire
• A new implementation technique for applicative languages
• Title not available (Why is that?)
• Another algorithm for bracket abstraction

Cited In (5)

• The search for a reduction in combinatory logic equivalent to \(\lambda \beta\)-reduction. II.
• The search for a reduction in combinatory logic equivalent to \(\alpha\beta\)-reduction
• Complexity of the combinator reduction machine
• On pseudo-c\(\beta\) normal form in combinatory logic
• Une nouvelle C\(\beta\)-réduction dans la logique combinatoire

This page was built for publication: \(c\beta\)-Machine with \(\lambda \beta\)-reduction

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