Proposal for a natural formalization of functional programming concepts
Patrick Bellot, Djamil Sarni (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “Call-by-value solvability”
Proposal for a natural formalization of functional programming concepts
Normal forms in the typed -calculus with tuple types
Jiří Zlatuška (1985)
Kybernetika
Similarity:
Bottlenecks in serial production lines: A system-theoretic approach.
Kuo, C.-T., Lim, J.-T., Meerkov, S.M. (1996)
Mathematical Problems in Engineering
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:
Logic and functional programming by retractions : operational semantics
M. Bellia (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Encoding fix in object calculi
Roy L. Crole (2000)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Executable specifications for data-type constructors
John W. Gray (1990)
Diagrammes
Similarity: