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

From apm
Jump to: navigation, search
(added basic definition)
 
Line 20: Line 20:
  
 
== Related ==
 
== Related ==
 +
 +
* Somewhat related: [[Tracing trajectories of component in machine phase]]
 +
 +
== External links ==
 +
 +
=== Related ===
  
 
* [https://futureofcoding.org/essays/dctp.html The Misunderstood Roots of FRP Can Save Programming (on futureofcoding.org – 2019)]
 
* [https://futureofcoding.org/essays/dctp.html The Misunderstood Roots of FRP Can Save Programming (on futureofcoding.org – 2019)]

Latest revision as of 13:20, 11 October 2023

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

External links

Related



Links needing review