c-Machine with -reduction

DOI10.1016/S0304-3975(97)00040-6MaRDI QIDQ1389686zbMATH OpenFDO

Authors Mohamed Mezghiche

Publication date 30 June 1998

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Une nouvelle C-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 normal form in combinatory logic

Cites work

• scientific article; zbMATH DE number 194911 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• A new implementation technique for applicative languages
• Another algorithm for bracket abstraction
• On pseudo-c\(\beta\) normal form in combinatory logic
• Une nouvelle C\(\beta\)-réduction dans la logique combinatoire

Cited in

(5)

• On pseudo-c\(\beta\) normal form in combinatory logic
• Complexity of the combinator reduction machine
• 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.
• 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)