Axiomatizing permutation equivalence

Mathematical Structures in Computer Science

Volumn 6, Issue 3, 1996, Pages 219-249

  Laneve, Cosimo ^a   Montanari, Ugo ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATIZING; COMBINATORY REDUCTION SYSTEMS; TERM REWRITING SYSTEMS;

BIOMINERALIZATION;

EID: 0000913087     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129500000980     Document Type: Article

References (16)

1. Abadi, M., Cardelli, L., Curien, P. L. and Levy, J. J. (1990) Explicit substitutions. In: Proceedings Yl'h ACM Symposium on Principles of Programmining Languages 59-71.
2. Aczel, P. (1978) A general Church-Rosser theorem. Draft, Manchester.
3. Boudol, G. (1985) Computational semantics of term rewriting systems. In: Nivat, M. and Reynolds, J. C. (eds.) Algebraic Methods in Semantics, Cambridge University Press 169-236.
4. Boudol, G. and Castellani, I. (1988) A non-interleaving semantics for CCS based on proved transitions. Fundamenta Informaticae 11 (4) 433-452.
5. Corradini, A. and Montanari, U. (1992) An algebraic semantics for structured transition systems and its application to logic programs. Theoretical Computer Science 103 51-106.
6. Curry, H. B. and Feys, R. (1974) Combinatory Logic, volume 1, North-Holland.
7. Klop, J. W. (1980) Combinatory Reduction System, Ph.D. thesis, Mathematisch Centrum, Amsterdam.
8. Klop, J. W., van Oostrom, V. and van Raamsdonk, F. (1993) Combinatory Reduction System: introduction and survey. Theoretical Computer Science 121 279-308.
9. Laneve, C. (1994) Distributive Evaluations of 1-calculus. Fundamenta Informaticae 20 (4) 333-352.
10. Laneve, C. and Montanari, U. (1992) Axiomatizing permutation equivalence in the calculus. In: yd Int. Conf. on Algebraic and Logic Programming. Springer-Verlag Lecture Notes in Computer Science 632 350-363.
11. Levy, J. J. (1980) Optimal reductions in the lambda-calculus. In: Seldin, J. P. and Hindley, J. R. (eds.) To H.B. Curry, Essays on Combinatory Logic, Lambda Calculus and Formalism, Academic Press 159-191.
12. Manca, V., Salibra, A. and Scollo, G. (1990) Equational type logic. Theoretical Computer Science 77 131-159.
13. Meseguer, J. (1992) Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 73-155.
14. Meseguer, J. and Goguen, J. A. (1985) Initiality, Induction and Computability. In: Nivat, M. and Reynolds, J. C. (eds.) Algebraic Methods in Semantics, Cambridge University Press.
15. Meseguer, J. and Montanari, U. (1990) Petri nets are monoids. Information and Computation 88 155-164.
16. Talcott, C. (1993) A theory of binding structures and applications to rewritings. Theoretical Computer Science 112 99-143.