DTP10 Call for Participation

Remember, Haskell is the world's most popular dependently typed functional programming language... (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> DTP 2010 --- Call for Participation EARLY REGISTRATION ENDS 17 MAY 2010 Workshop on DEPENDENTLY TYPED PROGRAMMING Edinburgh, Scotland, 9&10 July 2010 (a FLoC workshop, affiliated with LICS) http://sneezy.cs.nott.ac.uk/darcs/dtp10/ (s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)->(s:S)*(p:P s)-> Roll up! Roll up! Register early, register often! http://www.floc-conference.org/registration.html Attendance at DTP10 can be yours at a BARGAIN price if you register BEFORE 17 MAY 2010. The preliminary programme for DTP10 is here: http://sneezy.cs.nott.ac.uk/darcs/dtp10/programme.html Invited Talks: Ana Bove, Chalmers University, "10 Years of Partiality and General Recursion" Matthieu Sozeau, Harvard University, "Elaborations in Type Theory" Contributed Talks: Edwin Brady, "Practical, efficient programming with dependent types" James Caldwell, "Extracting Monadic Programs form Proofs", (joint work with Josef Pohl) Adam Chlipala, "Generating Pieces of Web Applications with Type-Level Programming" Nils Anders Danielsson, TBA Larry Diehl, "Unit & integration test composition via lemmas" Makoto Hamana, "Another Initial Algebra Semantics of Inductive Families for Programming" Hugo Herbelin, "A sequent calculus presentation of the Calculus of Inductive Constructions" (joint work with Jeffrey Sarnat, Vincent Siles) Karim Kariso, "Integrating Agda and Automated Theorem Proving Techniques" (joint work with Anton Setzer) Dan Licata, "Security-Typed Programming within Dependently Typed Programming" (joint work with Jamie Morgenstern) Ulf Norell, TBA Carsten Schuermann, "The HOL-Nuprl connection in Delphin", (joint work with Adam Poswolsky) Anton Setzer, "Coalgebras in dependent type theory" Antonis Stampoulis, "VeriML: Type-safe computation of logical terms inside a language with effects" Tarmo Uustalu, TBA Sean Wilson, "Supporting Dependently Typed Functional Programming with Proof Automation and Testing" If, by some chance, you are interested in talking at DTP10, please do get in touch. Space in the programme is now very tight, but we remain open to proposals. See you in Edinburgh in July! Thorsten and Conor _______________________________________________ Agda mailing list Agda@lists.chalmers.se https://lists.chalmers.se/mailman/listinfo/agda

"Conor" == Conor McBride
writes:
Conor> Remember, Haskell is the world's most popular dependently Conor> typed functional programming language... Could you justify that claim please? -- Colin Adams Preston Lancashire () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments

On 6 May 2010, at 16:04, Colin Paul Adams wrote:
"Conor" == Conor McBride
writes: Conor> Remember, Haskell is the world's most popular dependently Conor> typed functional programming language...
Could you justify that claim please?
Is that a feature request or a sceptical objection? If the former, I'm on the case already. If the latter... avec plaisir. Which part of it do you dispute? That Haskell is a dependently typed functional programming language? Justification: cabal install she I know. It's not Haskell in the sense that the language compiled by GHC is not Haskell. The genie is far enough out of the bottle. Or is it my claim that Haskell is more popular than the other dependently typed programming languages? Judging by community traffic, Haskell is more popular than Coq. By construction, Haskell is at least as popular as Agda. I could name a few others (e.g., ATS, Idris), but they're clearly not touching Haskell for presence. Now, of course, the dependently typed functionality available in Haskell is a bit rudimentary compared to functional languages defined with dependent types in mind. I certainly don't think Haskell is popular for being dependently typed, or that dependently typed programmers favour Haskell as weapon-of-choice (actually, for language *implementation*, many of us do), but I was careful not to claim either of those things. Haskell has data-indexed types, via a suitable encoding, which SHE automates, and even some dependency on run-time data, via a singleton type encoding (the ugliness of which SHE does her best to tidy away). Everything you need to start experimenting with indexing your data and control structures is in the box already. Indexed versions of Functor and Monad are already beginning to emerge and prove useful. Indexed Monads are just what you get when you yank Hoare Logic through the Curry-Howard correspondence from proof to programming. Key question: how should the library equip us to exploit these notions effectively? So I will finish with some bold speculation, as it's election day and I've constructed enough content-free sloganeering already. If you want to use a bit of dependent typing pervasively in a real world application, linking with a wealth of libraries, Haskell's likely to be your best bet. For now. For a while yet, actually. Interesting times Conor
participants (2)
-
Colin Paul Adams
-
Conor McBride