Semantic Domain
Monday, December 3, 2012
Total Functional Programming in a Partial Impure Language
›
In my last post , I showed how you could implement the Int construction over resumptions, to derive a higher-order programming language ...
5 comments:
Wednesday, November 28, 2012
The Geometry of Interaction, as an OCaml program
›
In this post, I'll show how to turn the Geometry of Interaction construction --- a model of linear logic --- into a runnable Ocaml ...
6 comments:
Wednesday, November 21, 2012
Polymorphism and limit-colimit coincidence in reactive languages
›
In my previous post, I mentioned limit-colimit coincidence, and how the ability to define fixed points makes that possible. It turns out the...
2 comments:
Tuesday, November 20, 2012
When it rains, it pours
›
Having written a new paper on FRP of my own , I've just discovered that lots of other people have been hard at work in this area. Alan...
3 comments:
Wednesday, November 14, 2012
New Draft: Simple and Efficient Higher-Order Reactive Programming
›
I've got a new draft out Simple and Efficient Higher-Order Reactive Programming . Here's the abstract: Functional reactive...
Monday, August 27, 2012
An astonishing isomorphism
›
I just learned today that in classical linear logic, the following type isomorphism holds: $$ (!A \multimap R) \multimap R \qquad\simeq\qqu...
1 comment:
Thursday, August 23, 2012
A Computational Lambda Calculus for Applicative Functors
›
These days, most people are familiar with using monads to structure functional programs, and are also familiar with Haskell's do-notatio...
4 comments:
‹
›
Home
View web version