sorted by: recent | see :
popular
Content Tagged with logic + cs
The Curry-Howard Correspondence in Haskell
Propositions and proofs in logic systems correspond to types and programs (or functions) in programming languages. Each proposition will be represented by a type. Each proof will be represented with a program that has the matching type.
A Neighborhood of Infinity: Data and Codata
"Is there some language that... can give us unbounded looping when we need it, but which never allows us to hoist ourselves by our petards by writing runaway loops?"
An Implementation of Session Types by Matthias Neubauer and Peter Thiemann
A session type is an abstraction of a set of sequences of heterogeneous values sent and received over a communication channel. Session types can be used for specifying stream-based Internet protocols. Typically, session types are attached to communication