Complexity of -term reductions
M. Dezani-Ciancaglini, S. Ronchi Della Rocca, L. Saitta (1979)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Right and left invertibility in -calculus”
Complexity of -term reductions
On a tree collision resolution algorithm in presence of capture
U. Schmid (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Uniformly growing backtrack trees
Rainer Kemp (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Frontiers of infinite trees
Bruno Courcelle (1978)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Digital search trees with keys of variable length
Markus E. Nebel (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Rebalancing operations for deletions in AVL-trees
Athanasios K. Tsakalidis (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: