Operational semantics (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Operational semantics" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2web.archive.org

1^st place

1^st place

179^th place

183^rd place

1sciencedirect.com

149^th place

178^th place

low place

7,273^rd place

1books.google.com

3^rd place

3^rd place

415^th place

327^th place

1concrete-semantics.org

low place

low place

books.google.com

Abadi, M.; Cardelli, L. (8 September 2012). A Theory of Objects. ISBN 9781441985989.

concrete-semantics.org

Nipkow, Tobias; Klein, Gerwin (2014). Concrete Semantics (PDF). pp. 101–102. doi:10.1007/978-3-319-10542-0. Retrieved Mar 13, 2024.

doi.org

Felleisen, M.; Hieb, R. (1992). "The Revised Report on the Syntactic Theories of Sequential Control and State". Theoretical Computer Science. 103 (2): 235–271. doi:10.1016/0304-3975(92)90014-7.
Plotkin, Gordon (1975). "Call-by-name, call-by-value and the λ-calculus" (PDF). Theoretical Computer Science. 1 (2): 125–159. doi:10.1016/0304-3975(75)90017-1. Retrieved July 22, 2021.
Felleisen, Matthias; Friedman, Daniel P. (1987). "A Reduction Semantics for Imperative Higher-Order Languages". Proceedings of the Parallel Architectures and Languages Europe. International Conference on Parallel Architectures and Languages Europe. Vol. 1. Springer-Verlag. pp. 206–223. doi:10.1007/3-540-17945-3_12.
Nipkow, Tobias; Klein, Gerwin (2014). Concrete Semantics (PDF). pp. 101–102. doi:10.1007/978-3-319-10542-0. Retrieved Mar 13, 2024.

mit.edu

mitpress.mit.edu

Felleisen, Matthias; Findler, Robert Bruce; Flatt, Matthew (2009). Semantics Engineering with PLT Redex. The MIT Press. ISBN 978-0-262-06275-6.

neu.edu

www2.ccs.neu.edu

Felleisen, Matthias (1987). The calculi of Lambda-v-CS conversion: a syntactic theory of control and state in imperative higher-order programming languages (PDF) (PhD). Indiana University. Retrieved July 22, 2021.

sciencedirect.com

Plotkin, Gordon (1975). "Call-by-name, call-by-value and the λ-calculus" (PDF). Theoretical Computer Science. 1 (2): 125–159. doi:10.1016/0304-3975(75)90017-1. Retrieved July 22, 2021.

stanford.edu

www-formal.stanford.edu

McCarthy, John. "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I". Archived from the original on 2013-10-04. Retrieved 2006-10-13.

web.archive.org

McCarthy, John. "Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I". Archived from the original on 2013-10-04. Retrieved 2006-10-13.
University of Illinois CS422