|
Google Research
Other Google Resources
|
Soren Lassen has a PhD in programming language semantics from University of Aarhus, Denmark. After 2 years as a Research Associate at the University of Cambridge Computer Laboratory, UK, he worked as lead architect and senior researcher at Digital Fountain, Fremont, CA, where he co-invented and implemented the Raptor erasure code and developed content delivery software and data transport protocols. Next, at Riverbed, San Francisco, CA, he contributed compression, caching, storage, and data transport software to the successful Steelhead product release. He joined Google in Mountain View as a software engineer in 2004, where he works on the crawl and indexing software behind the web search engine.
A complete, co-inductive syntactic theory of sequential control and state, Kristian Støvring, Soren B. Lassen, Proc. 34th Annual ACM Symposium on Principles of Programming Languages, 2007, pp. 161-172.
Typed Normal Form Bisimulation, Soren B. Lassen, Paul Blain Levy, Proceedings of the 21st International Workshop on Computer Science Logic (CSL'07), 2007, pp. 283-297.
Head Normal Form Bisimulation for Pairs and the Lambda Mu-Calculus (Extended Abstract), Soren B. Lassen, Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS' 06), 2006, pp. 297-306.
Normal Form Simulation for McCarthy's Amb, Soren B. Lassen, Proceedings of the 21st Annual Conference on Mathematical Foundations of Programming Semantics (MFPS XXI), 2006, pp. 445-465.
Eager Normal Form Bisimulation, Soren B. Lassen, Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), 2005, pp. 345-354.
|
|
