coq-club AT inria.fr
Subject: The Coq mailing list
List archive
- From: "J. Ian Johnson" <ianj AT ccs.neu.edu>
- To: coq-club AT inria.fr
- Subject: Re: [Coq-Club] Commercial applications of dependent type theory?
- Date: Tue, 25 Mar 2014 12:06:32 -0400 (EDT)
Scala fits this bill, no? The shapeless library is a common tool in the
toolbelt, which does lots of type level computation. I can't say which
commercial entities are serious users of it off hand, however.
This might be a question for Twitter, since there are a bunch of Scala
hackers there.
Also see the actual simply typed lambda calculus in Scala's type system here
https://apocalisp.wordpress.com/2009/09/02/more-scala-typehackery/
-Ian
----- Original Message -----
From: "Adam Chlipala"
<adamc AT csail.mit.edu>
To: "coq-club"
<coq-club AT inria.fr>
Sent: Tuesday, March 25, 2014 11:21:45 AM GMT -05:00 US/Canada Eastern
Subject: [Coq-Club] Commercial applications of dependent type theory?
Does anyone have any pointers to lists of commercial systems that use
dependent type theory? I mean "type theory" in a fairly loose sense,
but the core characteristic I'm interested in is a complete copy of
simply typed lambda calculus, or something fancier, embedded in a static
type language. I think GHC Haskell doesn't qualify, because they don't
really seem to have type-level lambdas that can be computed with in the
usual way, to support predictable enough type inference.
Thanks!
- [Coq-Club] Commercial applications of dependent type theory?, Adam Chlipala, 03/25/2014
- Re: [Coq-Club] Commercial applications of dependent type theory?, J. Ian Johnson, 03/25/2014
- Re: [Coq-Club] Commercial applications of dependent type theory?, Adam Chlipala, 03/26/2014
- Re: [Coq-Club] Commercial applications of dependent type theory?, J. Ian Johnson, 03/25/2014
Archive powered by MHonArc 2.6.18.