Author:
Forest Julien,Kesner Delia
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference25 articles.
1. Baader, F., Nipkow, T.: Term Rewriting and all that. Cambridge University Press (1998)
2. Barendregt, H.: The lambda calculus: its syntax and semantics, vol. 103. Studies in Logic and the Foundations of Mathematics. North-Holland. Revised Edition (1984)
3. Blanqui, F., Jouannaud, J.-P., Okada, M.: Inductive-data-type systems. Theoretical Comput. Sci. 277, 41–68 (2002)
4. Bonelli, E., Kesner, D., Ríos, A.: A de Bruijn notation for higher-order rewriting. In: L. Bachmair (ed.) 11th International Conference on Rewriting Techniques and Applications, vol. 1833 of Lecture Notes in Computer Science. pp. 62–79, Springer (2000)
5. Cerrito, S., Kesner, D.: Pattern matching as cut elimination. In: Longo, G. (ed.) 14th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 98–108. IEEE Computer Society Press (1999)