Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
I added a couple of references for the claim
There is a Curry–Howard correspondence between linear-time temporal logic (LTL) and functional reactive programming (FRP).
How about for CLT and CLT* (in the computation tree logic section)?
Were we looking to integrate this section with the one above on temporal type theory as an adjoint logic, could there be a way via some branching representation of our type as a tree?
I see Joachim Kock has an interesting way of presenting trees.
I remember now, Bas and I were talking about such matters back here.
Did you mean to link to that paper? I don’t see a discussion between you and Bas there.
Whoops, no. Fixed now.
Added the reference
1 to 9 of 9