Difference between revisions of "WG211/M3Schedule"

From WG 2.11
Jump to: navigation, search
 
Line 84: Line 84:
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3Kamin* Partial evaluation of static analyses for programs with holes]]<br>
+
[[WG211/M3Kamin| Partial evaluation of static analyses for programs with holes]]<br>
 
Sam Kamin
 
Sam Kamin
 
</p>
 
</p>
Line 93: Line 93:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3Lammel* Typed XML programming without serialization]]<br>
+
[[WG211/M3Lammel| Typed XML programming without serialization]]<br>
 
Ralf L&auml;mmel
 
Ralf L&auml;mmel
  
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3Striegnitz* Type Systems to Support Language Embeddings]]<br>
+
[[WG211/M3Striegnitz| Type Systems to Support Language Embeddings]]<br>
 
J&ouml;rg Striegnitz
 
J&ouml;rg Striegnitz
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3Weirich* Practical type inference for advanced type systems]]<br>
+
[[WG211/M3Weirich | Practical type inference for advanced type systems]]<br>
 
Stephanie Weirich
 
Stephanie Weirich
  
Line 112: Line 112:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3Swierstra* Dynamically Extending Syntax and Semantics]]<br>
+
[[WG211/M3Swierstra | Dynamically Extending Syntax and Semantics]]<br>
 
Doaitse Swierstra
 
Doaitse Swierstra
  
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3Smaragdakis* Easy Non-Intrusive Java Language Extensions with MAJ]]<br>
+
[[WG211/M3Smaragdakis | Easy Non-Intrusive Java Language Extensions with MAJ]]<br>
 
Yannis Smaragdakis
 
Yannis Smaragdakis
 
</p>
 
</p>
 
<p>
 
<p>
[[http://smart-generators.org/M3LeMeur* Integrating concerns into software architectures]]<br>
+
[[WG211/M3LeMeur| Integrating concerns into software architectures]]<br>
 
Anne-Fran&ccedil;oise Le Meur
 
Anne-Fran&ccedil;oise Le Meur
 
</p>
 
</p>
Line 131: Line 131:
 
<p>
 
<p>
  
[[http://smart-generators.org/M3Taha* A monadic approach to avoiding code duplication]]<br>
+
[[WG211/M3Taha | A monadic approach to avoiding code duplication]]<br>
 
Walid Taha
 
Walid Taha
  
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3Veldhuizen* Tradeoffs in Metaprogramming]]<br>
+
[[WG211/M3Veldhuizen| Tradeoffs in Metaprogramming]]<br>
 
Todd Veldhuizen.
 
Todd Veldhuizen.
  
Line 146: Line 146:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3CohenDiscussion* How can we make metaprogramming predictable and enjoyable?]]<br>
+
[[WG211/M3CohenDiscussion| How can we make metaprogramming predictable and enjoyable?]]<br>
 
Albert Cohen
 
Albert Cohen
 
</p>
 
</p>
Line 155: Line 155:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3Kelly* Domain-Specific Interpreters]]<br>
+
[[WG211/M3Kelly| Domain-Specific Interpreters]]<br>
 
Paul Kelly
 
Paul Kelly
  
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3Moggi* Program generation by linking]]<br>
+
[[WG211/M3Moggi| Program generation by linking]]<br>
 
Eugenio Moggi
 
Eugenio Moggi
  
 
</p><p>
 
</p><p>
  
[[http://smart-generators.org/M3LopezHerrejon* Mapping Features to Aspects]]<br>
+
[[WG211/M3LopezHerrejon| Mapping Features to Aspects]]<br>
 
Roberto Lopez-Herrejon
 
Roberto Lopez-Herrejon
 
</p>
 
</p>
Line 174: Line 174:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3LawallLengauerDiscussion* The future and potential of AOP]]</a><br>
+
[[WG211/M3LawallLengauerDiscussion| The future and potential of AOP]]</a><br>
 
Julia Lawall and Christian Lengauer
 
Julia Lawall and Christian Lengauer
  
Line 184: Line 184:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3LawallLengauerDiscussion* The future and potential of AOP (cont'd)]]</a><br>
+
[[WG211/M3LawallLengauerDiscussion| The future and potential of AOP (cont'd)]]</a><br>
 
Julia Lawall and Christian Lengauer
 
Julia Lawall and Christian Lengauer
  
Line 194: Line 194:
  
 
<p>
 
<p>
[[http://smart-generators.org/M3Gl&uuml;ck* The structure of a program inverter]]<br>
+
[[WG211/M3Glück | The structure of a program inverter]]<br>
 
Robert Gl&uuml;ck
 
Robert Gl&uuml;ck
  
 
</p>
 
</p>
 
<p>
 
<p>
[[http://smart-generators.org/M3Pouzet* Extending Synchronous Dataflow with State Machines by Means of Program Transformations]]<br>
+
[[WG211/M3Pouzet| Extending Synchronous Dataflow with State Machines by Means of Program Transformations]]<br>
 
Marc Pouzet
 
Marc Pouzet
  
Line 211: Line 211:
 
<p>
 
<p>
  
[[http://smart-generators.org/M3Visser* A Framework for Transformation of Java Programs]]<br>
+
[[WG211/M3Visser| A Framework for Transformation of Java Programs]]<br>
 
Eelco Visser
 
Eelco Visser
 
</p>
 
</p>
 
<p>
 
<p>
  
[[http://smart-generators.org/M3Hammond* Proving Size Bounds with Dependent Types]]<br>
+
[[WG211/M3Hammond| Proving Size Bounds with Dependent Types]]<br>
 
Edwin Brady
 
Edwin Brady
  
 
</p><p>
 
</p><p>
[[http://smart-generators.org/M3Cohen* N-Synchronous Kahn Networks: A Domain-Specific Program Generation Perspective]]<br>
+
[[WG211/M3Cohen| N-Synchronous Kahn Networks: A Domain-Specific Program Generation Perspective]]<br>
 
Albert Cohen
 
Albert Cohen
 
</p>
 
</p>
Line 230: Line 230:
 
<p>
 
<p>
  
[[http://smart-generators.org/M3ODonnell* Equational Reasoning with Circuit Transformations in Hydra]]<br>
+
[[WG211/M3ODonnell| Equational Reasoning with Circuit Transformations in Hydra]]<br>
 
John O'Donnell
 
John O'Donnell
 
</p><p>
 
</p><p>
Line 237: Line 237:
 
</p>
 
</p>
 
<p>
 
<p>
[[http://smart-generators.org/M3Rauchwerger* STAPL: A High Productivity Parallel Programming Environment]]<br>
+
[[WG211/M3Rauchwerger| STAPL: A High Productivity Parallel Programming Environment]]<br>
 
Lawrence Rauchwerger
 
Lawrence Rauchwerger
 
</p>
 
</p>
Line 247: Line 247:
 
<p>
 
<p>
  
[[http://smart-generators.org/M3KaminDiscussion* Compelling examples of program generation]]<br>
+
[[WG211/M3KaminDiscussion| Compelling examples of program generation]]<br>
 
Sam Kamin and Eelco Visser
 
Sam Kamin and Eelco Visser
  
Line 267: Line 267:
 
<p>
 
<p>
  
[[http://smart-generators.org/M3Swierstra2* Implicit Program Generation]]<br>
+
[[WG211/M3Swierstra2| Implicit Program Generation]]<br>
 
Doaitse Swierstra
 
Doaitse Swierstra
  
Line 283: Line 283:
  
  
</html>
 
  
 
==File Attachments==  
 
==File Attachments==  

Latest revision as of 15:26, 16 December 2011


IFIP WG2.11, meeting schedule

IFIP Working Group 2.11 Third Meeting

Schedule

January 25-28, 2006, Dagstuhl, Germany


WG211/ArrivalDepartureTaxiSharing

Attendees

Members: (20)

Albert Cohen, Charles Consel, Krzysztof Czarnecki, Robert Glück, Kevin Hammond, Christoph A. Herrmann, Sam Kamin, Paul Kelly, Julia Lawall, Christian Lengauer, Eugenio Moggi, John O'Donnell, Christine Paulin, Marc Pouzet, Laurent Reveillere, Yannis Smaragdakis, Jörg Striegnitz, Walid Taha, Todd Veldhuizen, Eelco Visser

Observers: (10)


Edwin Brady, Marco Danelutto, Gabor Karsai, Ralf Lämmel, Anne-Francoise Le Meur, Roberto Lopez-Herrejon, Francesco Nidito, Lawrence Rauchwerger, Doaitse Swierstra, Stephanie Weirich

Costs

The cost of the meeting will be 80 euros per night for a single room and 50 euros per person per night for a double room. Costs are payable at the end of the meeting.

Schedule

Talks will be 20 minutes in length, excluding questions.

Wednesday 9:00-10:00

Session chair: Christian Lengauer

A proposal for Domain-Specific Software Engineering
Charles Consel

Wednesday 10:30-12:00

Session chair: Walid Taha

Verifying Model Templates
Krzysztof Czarnecki

Generative aspects in skeletons
Marco Danelutto

Partial evaluation of static analyses for programs with holes
Sam Kamin

Wednesday 14:30-16:00

Session chair: Christoph Herrmann

Typed XML programming without serialization
Ralf Lämmel

Type Systems to Support Language Embeddings
Jörg Striegnitz

Practical type inference for advanced type systems
Stephanie Weirich

Wednesday 16:30-18:00

Session chair: Paul H. J. Kelly

Dynamically Extending Syntax and Semantics
Doaitse Swierstra

Easy Non-Intrusive Java Language Extensions with MAJ
Yannis Smaragdakis

Integrating concerns into software architectures
Anne-Françoise Le Meur

Thursday 9:00-10:00

Session chair: John T O'Donnell

A monadic approach to avoiding code duplication
Walid Taha

Tradeoffs in Metaprogramming
Todd Veldhuizen.

Thursday 10:30-12:00

Discussion Session:

How can we make metaprogramming predictable and enjoyable?
Albert Cohen

Thursday 14:30-16:00

Session chair: Julia Lawall

Domain-Specific Interpreters
Paul Kelly

Program generation by linking
Eugenio Moggi

Mapping Features to Aspects
Roberto Lopez-Herrejon

Thursday 16:30-18:00

Discussion Session:

The future and potential of AOP</a>
Julia Lawall and Christian Lengauer

Thursday 20:00-21:00

Discussion Session:

The future and potential of AOP (cont'd)</a>
Julia Lawall and Christian Lengauer

Friday 9:00-10:00

Session chair: Albert Cohen

The structure of a program inverter
Robert Glück

Extending Synchronous Dataflow with State Machines by Means of Program Transformations
Marc Pouzet


Friday 10:30-12:00

Session chair: Todd Veldhuizen

A Framework for Transformation of Java Programs
Eelco Visser

Proving Size Bounds with Dependent Types
Edwin Brady

N-Synchronous Kahn Networks: A Domain-Specific Program Generation Perspective
Albert Cohen

Friday 14:30-16:00

Session chair: Kevin Hammond

Equational Reasoning with Circuit Transformations in Hydra
John O'Donnell

[Generating size-parameterized functions for circuit simulation using Template Haskell]
Christoph A. Herrmann

STAPL: A High Productivity Parallel Programming Environment
Lawrence Rauchwerger

Friday 16:30-18:00

Discussion Session:

Compelling examples of program generation
Sam Kamin and Eelco Visser

Friday 20:00-21:00

Discussion Session:

Planning of future WG 2.11 activities and events
Walid Taha

Saturday 9:00-10:00

Session chair: Christian Lengauer

Implicit Program Generation
Doaitse Swierstra

Saturday 10:30-12:00

Final discussions


Meeting coordinator

Christian Lengauer: e-mail: [lengauer@fmi.uni-passau.de]


File Attachments