Reduction languages for reduction machines

Berkling, Klaus J.

doi:10.1145/642089.642112

Cited by 36 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The substitution rules of lambda-calculus based languages present serious problems for the machine designer. Bedding [3] has developed a modified lambda calculus that has three kinds of applications and that makes renaming of vail-…”

Section: Remarks About Computer Designmentioning

confidence: 99%

Can programming be liberated from the von Neumann style?

Backus

2007

ACM Turing Award Lectures

352

455

View full text Add to dashboard Cite

General permission to make fair use in teaching or research of all or part of this material is granted to individual readers and to nonprofit libraries acting for them provided that ACM's copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinting privileges were granted by permission of the Association for Computing Machinery. To otherwise reprint a figure, table, other substantial excerpt, or the entire work requires specific permission as does republication, or systematic or multiple reproduction.

show abstract

Section: Remarks About Computer Designmentioning

confidence: 99%

Can programming be liberated from the von Neumann style?

Backus

2007

ACM Turing Award Lectures

352

455

View full text Add to dashboard Cite

show abstract

“…We claim that logic programming features can be equally expressed in a purely functional programming paradigm, without changes on the basic mechanisms of functional languages, and without the introduction of any additional construct or mechanism, e. g. logical variables and, narrowing or unification. Inside this functional paradigm, logic programming as well as functional programming can be formulated by combinatory formulas for which promising realizations of réduction machines are in progress [Berkling75,Clarke80,Darlington81,Kluge80,Mago80,Hankin85], and they could be the natural machine support for our super-language. Functional languages are potential super-languages in which logic and functional programming features can be combined in a natural and semantically clean way.…”

Section: Introductionmentioning

confidence: 99%

Logic and functional programming by retractions

Bellia¹

1988

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

Logic and functional programming by retractions Informatique théorique et applications, tome 22, n o 3 (1988), p. 271-310. © AFCET, 1988, tous droits réservés. L'accès aux archives de la revue « Informatique théorique et applications » implique l'accord avec les conditions générales d'utilisation (http://www.numdam. org/legal.php). Toute utilisation commerciale ou impression systématique est constitutive d'une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente mention de copyright. Article numérisé dans le cadre du programme Numérisation de documents anciens mathématiques http://www.numdam.org/ Informatique théorique et Applications/Theoretical Informaties and Applications (vol. 22* n° 3, 1988, p. 271 à 310) LOGIC AND FUNCTIONAL PROGRAMMING BY RETRACTIONS (*) by M. BELLIA (l)

show abstract

Comments on “applicative programming” by hamilton richards: Complementary remarks on applicative systems

Kluge

1985

Systems Research

View full text Add to dashboard Cite

show abstract

Reduction languages for reduction machines

Cited by 36 publications

References 0 publications

Can programming be liberated from the von Neumann style?

Can programming be liberated from the von Neumann style?

Logic and functional programming by retractions

Comments on “applicative programming” by hamilton richards: Complementary remarks on applicative systems

Contact Info

Product

Resources

About