Efficient simulation of forward-branching systems with constructor systems

Journal of Symbolic Computation

Volumn 22, Issue 4, 1996, Pages 381-399

  Salinier, Bruno ^a   Strandh, Robert ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030269172     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0058     Document Type: Article

References (11)

1. Durand, I. (1994). Bounded, strongly sequential and forward-branching term rewriting systems. J. Symbolic Computation, 18(4):319-352.
2. Durand, I., Salinier, B. (1993). Constructor equivalent term rewriting systems. Information Processing Letters, 47:131-137.
3. Durand, I., Salinier, B. (1994). Constructor equivalent term rewriting systems are strongly sequential : A direct proof. Information Processing Letters, 52:137-145.
4. Huet, G., Lévy, J.-J. (1991). Computations in orthogonal term rewriting systems. In Lassez, J.-L., Plotkin, G., (eds), Computational Logic: Essays in Honor of Alan Robinson, pp. 397-443. MIT Press.
5. Klop, J. W., Middeldorp, A. (1991). Sequentially in orthogonal term rewriting systems. J. Symbolic Computation, 12:161-195.
6. Rebelsky, S. A. (1993). Tours, A System for Lazy Term-based Communication. PhD thesis, University of Chicago, Chicago, Illinois.
7. Rosen, B. K. (1973). Tree-manipulating systems and Church-Rosser theorems. J. ACM, 20(1): 160-187.
8. Salinier, B. (1995). Simulation de systèmes de réécriture de termes par des systèmes constructeurs. Thèse de doctorat, Université Bordeaux I, 351 cours de la Libération, 33405 Talence, France.
9. Strandh, R. I. (1988). Compiling Equational Programs into Efficient Machine Code. PhD thesis, Johns Hopkins University, Baltimore, Maryland.
10. Strandh, R. I. (1989). Classes of equational programs that compile into efficient machine code. In Dershowitz, N., (ed.), Proceedings of the Third International Conference on Rewriting Techniques and Applications, Chapel Hill, North Carolina, USA, April 1989, volume 355 of Lecture Notes in Computer Science, pp. 449-461. Springer-Ver lag.
11. Thatte, S. (1985). On the correspondence between two classes of reduction systems. Information Processing Letters, 20:83-85.