CEK Machine (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "CEK Machine" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

2books.google.com

3^rd place

2semanticscholar.org

11^th place

8^th place

2indiana.edu

2,113^th place

1,465^th place

1web.archive.org

1^st place

1bham.ac.uk

6,934^th place

4,192^nd place

1umd.edu

1,747^th place

1,277^th place

1colorado.edu

2,526^th place

1,796^th place

1bath.ac.uk

low place

7,058^th place

1brics.dk

low place

1worldcat.org

5^th place

1wkrozowski.github.io

low place

1arxiv.org

69^th place

59^th place

arxiv.org

Danvy, Olivier; Millikin, Kevin (2008). "A rational deconstruction of Landin's SECD machine with the J operator". Logical Methods in Computer Science. 4 (4): 1–67. arXiv:0811.3231. doi:10.2168/LMCS-4(4:12)2008. S2CID 7926360.

bath.ac.uk

cs.bath.ac.uk

"secd". www.cs.bath.ac.uk. Retrieved 2020-09-23.

bham.ac.uk

cs.bham.ac.uk

Thielecke, Hayo (December 9, 2015). "Implementing functional languages with abstract machines" (PDF). Archived from the original (PDF) on 2021-07-17. Retrieved September 9, 2020.

books.google.com

Jens Palsberg (28 August 2009). Semantics and Algebraic Specification: Essays Dedicated to Peter D. Mosses on the Occasion of His 60th Birthday. Springer Science & Business Media. pp. 162–. ISBN 978-3-642-04163-1.
Felleisen, Matthias; Findler, Robert Bruce; Flatt, Matthew (10 July 2009). Semantics Engineering with PLT Redex. MIT Press. pp. 113–. ISBN 978-0-262-25817-3.

brics.dk

Danvy, Olivier (2004). A Rational Deconstruction of Landin's SECD Machine (PDF). Implementation and Application of Functional Languages, 16th International Workshop, IFL 2004, Revised Selected Papers, Lecture Notes in Computer Science 3474, Springer. pp. 52–71. ISSN 0909-0878.

colorado.edu

ecee.colorado.edu

"The SECD Virtual Machine" (PDF).

doi.org

Accattoli, Beniamino; Barenbaum, Pablo; Mazza, Damiano (19 August 2014), "Distilling abstract machines", Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, ACM, pp. 363–376, doi:10.1145/2628136.2628154, ISBN 9781450328739, They differ on how they behave with respect to applications: the CEK implements left-to-right call-by-value, i.e. it first evaluates the function part, the LAM gives instead precedence to arguments, realizing right-to-left call-by-value.
Felleisen, Matthias; Friedman, Daniel (1986). Control Operators, the SECD Machine, and the $\lambda$ -Calculus. Formal Description of Programming Concepts III, Elsevier Science Publishers B.V. (North-Holland). pp. 193–217. doi:10.1007/978-3-319-14125-1_13.
Reynolds, John C. (1972). "Definitional Interpreters for Higher-Order Programming Languages". Proceedings of the ACM annual conference on - ACM '72. Vol. 2. Proceedings of 25th ACM National Conference. pp. 717–740. doi:10.1145/800194.805852.
Reynolds, John C. (1998). "Definitional Interpreters Revisited". Higher-Order and Symbolic Computation. 11 (4): 355–361. doi:10.1023/A:1010075320153. S2CID 34126862.
Thielecke, Hayo (2004). "Answer Type Polymorphism in Call-by-Name Continuation Passing". Programming Languages and Systems. Lecture Notes in Computer Science. Vol. 2986. Programming Languages and Systems, 13th European Symposium on Programming, ESOP 2004, LNCS 2986, Springer. pp. 279–293. doi:10.1007/978-3-540-24725-8_20. ISBN 978-3-540-21313-0.
Ager, Mads Sig; Biernacki, Dariusz; Danvy, Olivier; Midtgaard, Jan (2003). "A Functional Correspondence between Evaluators and Abstract Machines". Brics Report Series. 10 (13). 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'03): 8–19. doi:10.7146/brics.v10i13.21783.
Biernacka, Małgorzata; Danvy, Olivier (2007). "A Concrete Framework for Environment Machines". ACM Transactions on Computational Logic. 9 (1). Article #6: 1–30. doi:10.7146/brics.v13i3.21909.
Danvy, Olivier; Millikin, Kevin (2008). "A rational deconstruction of Landin's SECD machine with the J operator". Logical Methods in Computer Science. 4 (4): 1–67. arXiv:0811.3231. doi:10.2168/LMCS-4(4:12)2008. S2CID 7926360.

indiana.edu

legacy.cs.indiana.edu

Felleisen, Matthias; Friedman, Daniel P. (October 1986). "A Calculus for Assignments in Higher-Order Languages" (PDF).

cs.indiana.edu

Felleisen, Matthias; Friedman, Daniel P. (1986). Control Operators, the SECD Machine, and the $\lambda$ -Calculus (PDF) (Technical report). Department of Computer Science, Indiana University. 197.

semanticscholar.org

api.semanticscholar.org

Reynolds, John C. (1998). "Definitional Interpreters Revisited". Higher-Order and Symbolic Computation. 11 (4): 355–361. doi:10.1023/A:1010075320153. S2CID 34126862.
Danvy, Olivier; Millikin, Kevin (2008). "A rational deconstruction of Landin's SECD machine with the J operator". Logical Methods in Computer Science. 4 (4): 1–67. arXiv:0811.3231. doi:10.2168/LMCS-4(4:12)2008. S2CID 7926360.

umd.edu

cs.umd.edu

"A refresher on the CEK machine". CMSC 330, Summer 2015. Retrieved 2020-09-19.

web.archive.org

Thielecke, Hayo (December 9, 2015). "Implementing functional languages with abstract machines" (PDF). Archived from the original (PDF) on 2021-07-17. Retrieved September 9, 2020.

wkrozowski.github.io

Rozowski, Wojciech (2021). Formally verified derivation of an executable and terminating CEK machine from call-by-value lambda-p-hat-calculus (PDF) (Thesis). University of Southampton.

worldcat.org

Danvy, Olivier (2004). A Rational Deconstruction of Landin's SECD Machine (PDF). Implementation and Application of Functional Languages, 16th International Workshop, IFL 2004, Revised Selected Papers, Lecture Notes in Computer Science 3474, Springer. pp. 52–71. ISSN 0909-0878.