[TYPES] Existing Work on Function Destructors or Haskell Type Spec?

[Philip Wadler]

There has never been a formal description of the type system for all of
Haskell, but the following may be relevant:

  https://dl.acm.org/citation.cfm?doid=227699.227700

Cheers, -- P


.   \ Philip Wadler, Professor of Theoretical Computer Science,
.   /\ School of Informatics, University of Edinburgh
.  /  \ and Senior Research Fellow, IOHK
. http://homepages.inf.ed.ac.uk/wadler/

On 19 March 2018 at 10:52, Zachary Palmer <zpalmer2 at swarthmore.edu> wrote:

> [ The Types Forum, http://lists.seas.upenn.edu/mailman/listinfo/types-list
> ]
>
> Hi, all!  I have a couple things I've been trying to find to no avail for
> a while, so I thought I'd ask the help of the list.
>
> The first is prior work involving typed function destructors other than
> application.  Cloud Haskell seems close, as the runtime essentially allows
> a restricted form of transmission of lambdas over a network and that
> requires the closures to be serialized.   I can't help but think, though,
> that there's some core theory I'm missing on the topic.  Is anyone familiar
> with any work of that sort?
>
> Second, I've also had little luck finding a formal type specification for
> Haskell.  The 1999 workshop paper "Typing Haskell in Haskell" by Mark Jones
> seems to be the closest thing I could find with search engines, and that's
> basically a Literate Haskell file. Does anyone know of an inference
> rule-style type system specification for the language?
>
> Thanks for your time!
>
> Best,
>
> Zach
>
-------------- next part --------------
An embedded and charset-unspecified text was scrubbed...
Name: not available
URL: <http://LISTS.SEAS.UPENN.EDU/pipermail/types-list/attachments/20180320/a0464f17/attachment.ksh>