| http://dbpedia.org/ontology/abstract
|
A CEK Machine is an abstract machine inven … A CEK Machine is an abstract machine invented by Matthias Felleisen and Daniel P. Friedman. 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. The CEK machine builds on the SECD machine by replacing the dump (call stack) with the more advanced continuation, and putting parameters directly into the environment, rather than pushing them on to the parameter stack first. Other modifications can be made which creates a whole family of related machines. For example, the CESK machine has the environment map variables to a pointer on the store, which is effectively a heap. This allows it to model mutable state better than the ordinary CEK machine. The CK machine has no environment, and can be used for simple calculi without variables.used for simple calculi without variables.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://legacy.cs.indiana.edu/ftp/techreports/TR202.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
65332236
|
| http://dbpedia.org/ontology/wikiPageLength
|
6350
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1121509906
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Postfix_notation +
, http://dbpedia.org/resource/Imperative_programming +
, http://dbpedia.org/resource/Daniel_P._Friedman +
, http://dbpedia.org/resource/Lazy_evaluation +
, http://dbpedia.org/resource/Continuation +
, http://dbpedia.org/resource/Matthias_Felleisen +
, http://dbpedia.org/resource/Functional_programming +
, http://dbpedia.org/resource/CEK_Machine +
, http://dbpedia.org/resource/SECD_machine +
, http://dbpedia.org/resource/Category:Abstract_machines +
, http://dbpedia.org/resource/Abstract_machine +
, http://dbpedia.org/resource/Lambda_calculus +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Notelist +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Main +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Abstract_machines +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/CEK_Machine?oldid=1121509906&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/CEK_Machine +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q104857237 +
, https://global.dbpedia.org/id/FT84h +
, http://dbpedia.org/resource/CEK_Machine +
|
| rdfs:comment |
A CEK Machine is an abstract machine inven … A CEK Machine is an abstract machine invented by Matthias Felleisen and Daniel P. Friedman. 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. abstract machine called the SECD machine.
|
| rdfs:label |
CEK Machine
|
