Difference between revisions of "Denotative continuous-time programming (Conal Elliott)"

From apm
Jump to: navigation, search
m
(added basic definition)
Line 4: Line 4:
 
But the meaning associated with the term drifted so far away from the original idea that <br>
 
But the meaning associated with the term drifted so far away from the original idea that <br>
 
it was '''renamed to "denotative continuous-time programming" (DCTP).'''
 
it was '''renamed to "denotative continuous-time programming" (DCTP).'''
+
 
 +
== Definition ==
 +
 
 +
(Taken from Conal Elliotts' slides)
 +
 
 +
'''Two fundamental properties of DCTP:'''
 +
* Precise, simple denotation. (Elegant & rigorous.)
 +
* ''Continuous time.'' (Natural & composable.)
 +
 
 +
'''Not DCTP:'''
 +
* graphs
 +
* updates and propagation
 +
* streams (since they are a discrete model, despite the name)
 +
* doing
 +
 
 
== Related ==
 
== Related ==
  

Revision as of 18:52, 15 July 2021

This article is a stub. It needs to be expanded.

Formerly called "functional reactive programming" (FRP).
But the meaning associated with the term drifted so far away from the original idea that
it was renamed to "denotative continuous-time programming" (DCTP).

Definition

(Taken from Conal Elliotts' slides)

Two fundamental properties of DCTP:

  • Precise, simple denotation. (Elegant & rigorous.)
  • Continuous time. (Natural & composable.)

Not DCTP:

  • graphs
  • updates and propagation
  • streams (since they are a discrete model, despite the name)
  • doing

Related



Links needing review