|![[Search]](http://talks.cam.ac.uk/images/search.gif?1209136071)
|![[A-Z Index]](http://talks.cam.ac.uk/images/az.gif?1209136071)
|![[Contact]](http://talks.cam.ac.uk/images/contact.gif?1209136071)
||![[University of Cambridge]](http://talks.cam.ac.uk/images/identifier2.gif?1209136071){kind=small} |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![[Talks.cam]](http://talks.cam.ac.uk/images/talkslogosmall.gif?1209136071) |
University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Towards Algebra-Oriented Programming
Towards Algebra-Oriented ProgrammingAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins. This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending Programs can be modularly decomposed in several dimensions. However, it has long been noted that existing programming languages typically suffer from ``the tyranny of the dominant decomposition’’, only supporting decomposition of programs well in one dimension. Bad support for other dimensions leads to crosscutting concerns: code that logically represents some separate, modular functionality of the program, but which is not easily modularized. The main problem lies in existing programming language structuring abstractions, such as algebraic/inductive datatypes in functional languages or object interfaces in object-oriented languages, which dictate the particular flavor of modularity supported by the language. This talk suggests a form of algebraic signatures, which we generally refer to as algebras, as an alternative programming language structuring abstraction. Algebras do not dictate a particular modularity dimension on the programmer. Instead they support various composition operators which allow them to cater for several dimensions of modularity at once. Algebras have desirable properties of a programming abstraction: they support modular type-checking, separate-compilation and modular reasoning/proofs. I will show how algebras can already be encoded in existing programming languages and theorem provers, and how they can help dealing with several practical problems: from modularizing DSL components, to modularizing inductive proofs and meta-theory of programming languages. I’ll finish the talk by discussing some of the remaining challenges on creating truly algebra-oriented programming languages. This talk is part of the Microsoft Research Cambridge, public talks series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsCambridge Centre for Political Thought Research Office Linked Events Cambridge and Anglian Materials Society meetings CERF Dr Chang Zhang Camtessential GroupOther talksExploring the mechanisms of haematopoietic lineage progression at the single-cell level CANCELLED DUE TO STRIKE ACTION Recent advances in understanding climate, glacier and river dynamics in high mountain Asia Art speak Intravital Imaging – Applications and Image Analysis/ Information session on Borysiewicz Biomedical Sciences Fellowships Saving the People of the Forest: one chocolate bar and one nebulizer treatment at a time Protein Folding, Evolution and Interactions Symposium Singularities of Hermitian-Yang-Mills connections and the Harder-Narasimhan-Seshadri filtration Stereodivergent Catalysis, Strategies and Tactics Towards Secondary Metabolites as enabling tools for the Study of Natural Products Biology 'Ways of Reading, Looking, and Imagining: Contemporary Fiction and Its Optics' Single Cell Seminars (October) Breckland, birds and conservation |
Bruno Oliveira, National University of Singapore
Tuesday 02 April 2013, 10:00-11:00