Everything About ___
Live briefing

Everything about CEK Machine

Theoretical computer model

A CEK Machine is an abstract machine invented by Matthias Felleisen and Daniel P. Friedman that implements left-to-right call by value. It is generally implemented as an interpreter for functional programming languages, but can also be used to implement simple imperative programming languages. A state in a CEK machine includes a control statement, environment and continuation. The control statement is the term being evaluated at that moment, the environment is (usually) a map from variable names to values, and the continuation stores another state, or a special halt case. It is a simplified form of another abstract machine called the SECD machine. Wikipedia →

đź§­ Start here: a 6-step reading path

  1. Read the overview: CEK MachineA 5-minute orientation
  2. Read the landmark paper: Analisis Sentimen Ulasan Aplikasi Cek Bansos pada Google Play Store Menggunakan Metode Support Vector MachineCited 0 times
  3. Go sideways: Meta-circular evaluatorA closely related topic
  4. Go sideways: Numerical rangeA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

📚 Books worth reading

Open Library didn't respond; try again in a moment.

đź”— Related topics