Logic and functional programming by retractions : operational semantics
Bellia, M.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988), p. 395-436 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1988__22_4_395_0,
     author = {Bellia, M.},
     title = {Logic and functional programming by retractions : operational semantics},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {22},
     year = {1988},
     pages = {395-436},
     mrnumber = {984584},
     zbl = {0666.68012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1988__22_4_395_0}
}

Bellia, M. Logic and functional programming by retractions : operational semantics. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 22 (1988) pp. 395-436. http://gdmltest.u-ga.fr/item/ITA_1988__22_4_395_0/

[Apt82] K. R. Apt and M. H. Van Emdem, Contribution to the Theory of Logic Programming, J. ACM, Vol. 29, 1982, pp. 841-862. | MR 666781 | Zbl 0483.68004

[Bellia88] M. Bellia, E. Damerl, P. Degano, G. Levi and M. Martelli, A Formal Model for Lazy Implementation of a PROLOG Compatible Functional Language. In Implementations of PROLOG, J. A.CAMPBELL Ed., Ellis Horwood, 1984, pp. 309-326.

[Bellia88] M. Bellia, Logic and Functional Programming by Retractions, RAIRO Inf. Théorique et Applications, Vol. 22, 1988, pp. | Numdam | MR 963593 | Zbl 0666.68011

[Berklin75] K. Berkling, Reduction Languages for Reduction Machines, Proc. 2nd Int. Symp. on Computer Architectures, IEEE Comp. Society Press, 1975, pp. 133-140.

[Berkling82] K. Berkling, J. A. Robinson and E. E. Sibert, A Proposal for a Fifth Generation Logic and Functional Programming System, based on Highly Parallel Reduction Machine Architecture, Syracuse University, November 1982.

[Berkling85] K. Berkling, Epsilon-reduction : Another view of Unification, CASE Center, Syracuse University, 1985.

[Dershowitz82] N. Dershowitz, Ordering for Term-rewriting Systems, Theoretical Computer Science, Vol. 17, 1982. pp. 279-301. | MR 648438 | Zbl 0525.68054

[Friedman76] D. Friedman and D. Wise, CONS Should not Evaluate its Arguments. In Automata, Languages and Programming P, S. MICHELSON Ed., Edinburgh Univ. Press, 1977, pp. 256-284. | Zbl 0461.68023

[Henderson76] P. Henderson and J. H. Morris, A Lazy Evaluator, Proc. Third ACM Symp. on Principles of Programming Languages, 1976, pp. 95-103.

[Henderson80] P. Henderson, Functional Programming, Application and Implementation, Prentice-Hall, Englewood Cliffs, N.J., 1980. | Zbl 0426.68059

[Huet80] G. Huet and D. C. Oppen, Equations and Rewrite Rules. A survey. INRIA Tech, Report 15, also as SRI Rep. STAN-CS-8O-785, january 1980.

[Kowalski74] R. A. Kowalski, Predicate Logic as a Programming Language, Proc. IFIP Congress, 1974, pp. 569-574. | MR 428765 | Zbl 0297.68006

[Martelli82] A. Martelli and U. Montanari, An Efficient Unification Algorithm, ACM TOPLAS, Vol. 4, 1982, pp. 258-282. | Zbl 0478.68093

[O'Donnell77] M. J. O'Donnell, Computing in System Described by Equations, LNCS 50, Springer-Verlag, Berlin, 1977. | MR 483644 | Zbl 0421.68038

[Paterson78] M. S. Paterson and M. N. Wegman, Linear Unification, J. Comp. System Science, Vol. 16, 1978, pp. 158-167. | MR 483794 | Zbl 0371.68013

[Stoy77] J. E. Stoy, Denotational Semantics, The Scott-Strachey Approach to Programming Languages, MIT Press, Cambridge, 1977. | MR 488969 | Zbl 0503.68059

[Treleaven82] P. C. Treleaven, Computer Architecture for Functional Programming, In Functional Programming and its Applications, J. Darlington. P. HENDERSON and D. A. TURNER Eds., Cambridge Univ. Press, 1982, pp. 281-306.