Personal tools

Hac φ/Talks

From HaskellWiki

< Hac φ(Difference between revisions)
Jump to: navigation, search
(Add Snap talk)
(Added Category:Community)
(9 intermediate revisions by 6 users not shown)
Line 1: Line 1:
 
If you'd like to give a talk, announce it here; tell us your name, the title of the talk, a short description. Please also let us know if you won't be attending Saturday afternoon and want to present at some other time.
 
If you'd like to give a talk, announce it here; tell us your name, the title of the talk, a short description. Please also let us know if you won't be attending Saturday afternoon and want to present at some other time.
 
== Talk ideas (not final) ==
 
 
* thoughtpolice would enjoy talking a bit about [http://impredicative.com/ur Ur/Web], for those interested in static types and web development.
 
   
 
== Talks ==
 
== Talks ==
Line 11: Line 7:
 
! Speaker
 
! Speaker
 
|-
 
|-
| MongoDB driver for Haskell
+
! Cyclotomic Numbers: Exact calculation with complex numbers
| Tony Hannan
+
! Scott Walck
 
|-
 
|-
| Building Web Apps with Snap
+
!(Tentative) Designing a Haskell Native Dataframe
| Doug Beardsley
+
!Carter Schonwald
  +
|-
  +
!Topology is computability
  +
!Mark Dominus
 
|}
 
|}
   
== Workshop Polls ==
 
 
=== Natural Language Syntax Formalisms ===
 
   
If you're interested in a workshop on formalisms for natural language syntax, please say so here so I can know to prepare something. It'll probably end up being very high-level, without implementations for much of it. [[User:Augur|Augur]] 22:49, 18 June 2011 (UTC)
+
[[Category:Community]]

Revision as of 13:04, 17 December 2012

If you'd like to give a talk, announce it here; tell us your name, the title of the talk, a short description. Please also let us know if you won't be attending Saturday afternoon and want to present at some other time.

Talks

Talk Name Speaker
Cyclotomic Numbers: Exact calculation with complex numbers Scott Walck
(Tentative) Designing a Haskell Native Dataframe Carter Schonwald
Topology is computability Mark Dominus