Nondeterminism and fully abstract models
Egidio Astesiano, Gerardo Costa (1980)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “On the decidability of the equivalence problem for monadic recursive programs”
Nondeterminism and fully abstract models
Implementing term rewriting by jungle evaluation
Berthold Hoffmann, Detlef Plump (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
An algorithm for finding a minimal recursive path ordering
Hassan Aït-Kaci (1985)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On sets bounded truth-table reducible to -selective sets
Thomas Thierauf, Seinosuke Toda, Osamu Watanabe (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Logic and functional programming by retractions : operational semantics
M. Bellia (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
Decidable subcases of the equivalence problem for recursive program schemes
Bruno Courcelle, Jean H. Gallier (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: