default search action
Higher-Order and Symbolic Computation, Volume 22
Volume 22, Number 1, March 2009
- Olivier Danvy, Julian A. Padget:
Editorial. 1 - Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. 3-66 - Matthew Naylor, Colin Runciman:
Expressible sharing for functional circuit description. 67-80 - Jean Bresson, Carlos Agón, Gérard Assayag:
Visual Lisp/CLOS programming in OpenMusic. 81-111
Volume 22, Number 2, June 2009
- Olivier Danvy, Carolyn L. Talcott:
Editorial. 113 - Aaron Stump:
Directly reflective meta-programming. 115-144 - David Monniaux:
A minimalistic look at widening operators. 145-154 - Patricia Johann, Neil Ghani:
A principled approach to programming with nested types in Haskell. 155-189 - Olivier Danvy:
Peter J. Landin (1930-2009). 191-195
Volume 22, Number 3, September 2009
- Olivier Danvy, Carolyn L. Talcott:
Editorial. 197 - Zaynah Dargaye, Xavier Leroy:
A verified framework for higher-order uncurrying optimizations. 199-231 - Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A type-theoretic foundation of delimited continuations. 233-273 - Kenichi Asai:
On typing delimited continuations: three new solutions to the printf problem. 275-291
Volume 22, Number 4, December 2009
- Olivier Danvy, Carolyn L. Talcott:
Editorial. 293 - Richard Bornat:
Peter Landin: a computer scientist who inspired a generation. 295-298 - Paul Boca:
Personal recollections of Peter Landin: 1987-2009. 299-303 - Kevin Hammond, Greg Michaelson:
The Peter Landin prize. 305-312 - Robert D. Tennent:
An introduction to Landin's "Getting Rid of Labels". 313-314 - Peter J. Landin:
Getting rid of labels. 315-329 - Tony Clark:
Stories about calculations: remembering Peter Landin. 331-332 - Peter J. Landin:
Calculations. 333-359
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.