On algebraic specifications of computable algebras with the discriminator technique
G. Gagliardi, S. Tulipani (1990)
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.
Displaying similar documents to “A note on fixpoint techniques in data base recursive logic programs”
On algebraic specifications of computable algebras with the discriminator technique
Top-down mathematical semantics and symbolic execution
G. Lévi, A. M. Pegna (1983)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
On the complexity of computable real sequences
Jacobo Torán (1987)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Data types as algorithms
M. A. Nait Abdallah (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Complexity of theorem-proving procedures : some general properties
G. Longo, M. Venturini Zilli (1974)
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:
Non recursive functions have transcendental generating series
Felipe Cucker, Joaquim Gabarró (1989)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: