Nondeterminism and fully abstract models
Egidio Astesiano, Gerardo Costa (1980)
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.
Displaying similar documents to “Toward a semantics for the QUEST language”
Nondeterminism and fully abstract models
Logic and functional programming by retractions : operational semantics
M. Bellia (1988)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Algebraic definition of a functional programming language and its semantic models
Manfred Broy, Martin Wirsing (1983)
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:
CPO-models for second order lambda calculus with recursive types and subtyping
E. Poll, C. Hemerik, H. M. M. Ten Eikelder (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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:
The decidability of the equivalence problem for polynomially bounded DOL sequences
Juhani Karhumäki (1977)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity: