際際滷shows by User: ekmett / http://www.slideshare.net/images/logo.gif 際際滷shows by User: ekmett / Tue, 22 May 2018 14:46:38 GMT 際際滷Share feed for 際際滷shows by User: ekmett Revisiting Combinators /slideshow/revisiting-combinators-edward-kmett/98087311 combinators-180522144638
Combinatory Logic]]>
Combinatory Logic]]> Tue, 22 May 2018 14:46:38 GMT /slideshow/revisiting-combinators-edward-kmett/98087311 ekmett@slideshare.net(ekmett) Revisiting Combinators ekmett Combinatory Logic <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/combinators-180522144638-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> Combinatory Logic
Revisiting Combinators from Edward Kmett
]]> 1574 2 https://cdn.slidesharecdn.com/ss_thumbnails/combinators-180522144638-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Bound /slideshow/bound-making-de-bruijn-succ-less/13768903 bound-makingdebruijnsuccless-120726171106-phpapp02
This talk covers a novel approach to "name binding" in syntax trees for programming languages that makes it much easier to write compilers and interpreters with a higher degree of assurance.]]>
This talk covers a novel approach to "name binding" in syntax trees for programming languages that makes it much easier to write compilers and interpreters with a higher degree of assurance.]]> Thu, 26 Jul 2012 17:11:03 GMT /slideshow/bound-making-de-bruijn-succ-less/13768903 ekmett@slideshare.net(ekmett) Bound ekmett This talk covers a novel approach to "name binding" in syntax trees for programming languages that makes it much easier to write compilers and interpreters with a higher degree of assurance. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/bound-makingdebruijnsuccless-120726171106-phpapp02-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> This talk covers a novel approach to &quot;name binding&quot; in syntax trees for programming languages that makes it much easier to write compilers and interpreters with a higher degree of assurance.
Bound from Edward Kmett
]]> 8645 6 https://cdn.slidesharecdn.com/ss_thumbnails/bound-makingdebruijnsuccless-120726171106-phpapp02-thumbnail.jpg?width=120&height=120&fit=bounds presentation White http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 Purely Functional Data Structures for On-Line LCA /slideshow/skewbinary-online-lowest-common-ancestor-search/13144385 skew-binaryonlinelca-120531015027-phpapp02
This talk improves the known asymptotic complexity of online lowest common ancestor search from O(h) to O(log h), opening the door to new uses in distributed computing and version control.]]>
This talk improves the known asymptotic complexity of online lowest common ancestor search from O(h) to O(log h), opening the door to new uses in distributed computing and version control.]]> Thu, 31 May 2012 01:50:26 GMT /slideshow/skewbinary-online-lowest-common-ancestor-search/13144385 ekmett@slideshare.net(ekmett) Purely Functional Data Structures for On-Line LCA ekmett This talk improves the known asymptotic complexity of online lowest common ancestor search from O(h) to O(log h), opening the door to new uses in distributed computing and version control. <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/skew-binaryonlinelca-120531015027-phpapp02-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br> This talk improves the known asymptotic complexity of online lowest common ancestor search from O(h) to O(log h), opening the door to new uses in distributed computing and version control.
Purely Functional Data Structures for On-Line LCA from Edward Kmett
]]> 6276 5 https://cdn.slidesharecdn.com/ss_thumbnails/skew-binaryonlinelca-120531015027-phpapp02-thumbnail.jpg?width=120&height=120&fit=bounds presentation White http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 SM&A Tech Team Services /slideshow/sma-tech-team-services/4653265 techteam-100630140025-phpapp02
]]>
]]> Wed, 30 Jun 2010 14:00:20 GMT /slideshow/sma-tech-team-services/4653265 ekmett@slideshare.net(ekmett) SM&A Tech Team Services ekmett <img style="border:1px solid #C3E6D8;float:right;" alt="" src="https://cdn.slidesharecdn.com/ss_thumbnails/techteam-100630140025-phpapp02-thumbnail.jpg?width=120&amp;height=120&amp;fit=bounds" /><br>
SM&A Tech Team Services from Edward Kmett
]]> 931 3 https://cdn.slidesharecdn.com/ss_thumbnails/techteam-100630140025-phpapp02-thumbnail.jpg?width=120&height=120&fit=bounds presentation Black http://activitystrea.ms/schema/1.0/post http://activitystrea.ms/schema/1.0/posted 0 https://public.slidesharecdn.com/v2/images/profile-picture.png Programmer, Mathematician, Defense Contractor, Quant Toolsmith, Polymath comonad.com/ https://cdn.slidesharecdn.com/ss_thumbnails/combinators-180522144638-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/revisiting-combinators-edward-kmett/98087311 Revisiting Combinators https://cdn.slidesharecdn.com/ss_thumbnails/bound-makingdebruijnsuccless-120726171106-phpapp02-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/bound-making-de-bruijn-succ-less/13768903 Bound https://cdn.slidesharecdn.com/ss_thumbnails/skew-binaryonlinelca-120531015027-phpapp02-thumbnail.jpg?width=320&height=320&fit=bounds slideshow/skewbinary-online-lowest-common-ancestor-search/13144385 Purely Functional Data...