![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 06 March 2012, 13:00-14:00
Extending deforestation
- đ¤ Speaker: William Sonnex (University of Cambridge)
- đ Date & Time: Tuesday 06 March 2012, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room SS03
Abstract
We present a technique to perform fully automated functional program simplifications beyond what is possible through ordinary deforestation. Our implementation can so far do simplifications such as “length (insert_sort xs) => length xs” and “reverse (reverse xs) => xs”. As our last property shows, these simplifications are for eagerly evaluated functional programs.
We will also show a correspondence between our extended deforestation, and automated proof in dependent type theory. In effect one can use the same algorithm to both find a simplification, and prove that the simplification is sound.
Series This talk is part of the Computer Laboratory Automated Reasoning Group Lunches series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Automated Reasoning Group Lunches
- Computer Laboratory, William Gates Building, Room SS03
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Martin's interesting talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk373's list
- yk449
Note: Ex-directory lists are not shown.