Subscribe: Comments for Existential Type
http://existentialtype.wordpress.com/comments/feed/
Preview: Comments for Existential Type

Comments for Existential Type



Thoughts from an existential type.



Last Build Date: Sat, 02 Dec 2017 16:41:32 +0000

 



Comment on Persistence of Memory by Notes on Idris – The Breakfast Post

Sat, 02 Dec 2017 16:41:32 +0000

[…] over Lisp, like the RLisp that the REDUCE algebra system was largely written in. Robert Harper once described Haskell as “the world’s best imperative programming language” and I can see where that comes […]



Comment on Dynamic Languages are Static Languages by JavaScript是一种无类型的语言吗? | CODE问答

Wed, 22 Nov 2017 17:20:13 +0000

[…] 所以问题是untyped有几个不同的定义 在上面的答案之一中已经讨论了一个定义 – 运行时不会标记值,只会将每个值视为位。 JavaScript does标记值,并基于这些标记具有不同的行为。所以JavaScript显然不适合这个类别。 另一个定义来自编程语言理论(布伦丹所指的学术性东西)。在这个领域,untyped只是意味着everything belongs to a single type。 为什么?因为一种语言只有在能够证明类型对齐的时候才会生成一个程序(又名the Curry-Howard correspondence;类型是定理,程序就是证明)。这意味着以一种无类型的语言: […]



Comment on Sequentiality as the Essence of Parallelism by Robert Harper

Tue, 07 Nov 2017 18:04:59 +0000

I have not. Sounds like a good idea to investigate.



Comment on Sequentiality as the Essence of Parallelism by Andy Adams-Moran

Tue, 07 Nov 2017 17:46:47 +0000

Your cost semantics looks like it would have a rich associated operational theory of cost approximation/equivalence; have you explored that at all?



Comment on Sequentiality as the Essence of Parallelism by Robert Harper

Tue, 07 Nov 2017 17:41:17 +0000

Sounds fascinating!



Comment on Sequentiality as the Essence of Parallelism by Robert Harper

Tue, 07 Nov 2017 17:39:27 +0000

Not that I know of, can you elaborate?



Comment on Sequentiality as the Essence of Parallelism by Vlad Patryshev (@vpatryshev)

Tue, 07 Nov 2017 16:05:28 +0000

Is it about applicative functors (aka closed functors)?



Comment on Sequentiality as the Essence of Parallelism by Gabor Greif

Tue, 07 Nov 2017 13:05:16 +0000

I still have to blog about it, but this is what I have had a lightning talk in London a few week ago (https://skillsmatter.com/conferences/8522-haskell-exchange-2017#program). The setting is that of configuring a complex (e.g. hierarchical) data transmission system. I collect all reconfiguration actions coming from a transaction in a bag, then add "rules" and wait for the "reactions" to stop (i.e. a fixpoint). The reactions themselves are guided by type-level "tags" on the actions and the rules are also on the type level. Things come together by means of type reflection. In the end the bag of actions will contain orthogonal actions and can be executed with maximal parallelism, since "harmful sequentialities" are eliminated by the process of saturating the rules. Next steps are to discover how to derive my "rules" (otherwise supplied by "domain experts") from the data-flow model of the device. I already got told to look into Michael Mendler's work on temporal logics to move forward with this.



Comment on Teaching FP to Freshmen by 11/5/17 – CS371p Fall 2017: Shallom Onoja

Mon, 06 Nov 2017 09:00:55 +0000

[…] https://existentialtype.wordpress.com/2011/03/15/teaching-fp-to-freshmen/ […]



Comment on It Is What It Is (And Nothing Else) by Mortimer Lamkin

Fri, 03 Nov 2017 09:44:31 +0000

The title reminded me of this: https://www.youtube.com/watch?v=sOCyADJaK_E N