- Gudmund Grov, Greg Michaelson:
Hume box calculus: robust system development through software transformation. High. Order Symb. Comput. 23(2): 191-226 (2010) - Fritz Henglein, Ken Friis Larsen:
Generic multiset programming with discrimination-based joins and symbolic Cartesian products. High. Order Symb. Comput. 23(3): 337-370 (2010) - David Herman, Aaron Tomb, Cormac Flanagan:
Space-efficient gradual typing. High. Order Symb. Comput. 23(2): 167-189 (2010) - Stefan Holdermans, Jurriaan Hage:
Making "stricterness" more relevant. High. Order Symb. Comput. 23(3): 315-335 (2010) - Arun Lakhotia, Davidson R. Boccardo, Anshuman Singh, Aleardo Manacero Jr.:
Context-sensitive analysis without calling-context. High. Order Symb. Comput. 23(3): 275-313 (2010) - Arie Middelkoop, Atze Dijkstra, S. Doaitse Swierstra:
A lean specification for GADTs: system F with first-class equality proofs. High. Order Symb. Comput. 23(2): 145-166 (2010) - Johannes Rudolph, Peter Thiemann:
Mnemonics: type-safe bytecode generation at run time. High. Order Symb. Comput. 23(3): 371-407 (2010) - Neil Sculthorpe, Henrik Nilsson:
Keeping calm in the face of change - Towards optimisation of FRP by reasoning about change. High. Order Symb. Comput. 23(2): 227-271 (2010) - Manuel Serrano, Christian Queinnec:
A multi-tier semantics for Hop. High. Order Symb. Comput. 23(4): 409-431 (2010) - Axel Simon, Andy King:
The two variable per inequality abstract domain. High. Order Symb. Comput. 23(1): 87-143 (2010) - Fausto Spoto, Étienne Payet:
Magic-sets for localised analysis of Java bytecode. High. Order Symb. Comput. 23(1): 29-86 (2010) - Wouter Swierstra:
More dependent types for distributed arrays. High. Order Symb. Comput. 23(4): 489-506 (2010) - 2009
- Zena M. Ariola, Hugo Herbelin, Amr Sabry:
A type-theoretic foundation of delimited continuations. High. Order Symb. Comput. 22(3): 233-273 (2009) - Kenichi Asai:
On typing delimited continuations: three new solutions to the printf problem. High. Order Symb. Comput. 22(3): 275-291 (2009) - Paul Boca:
Personal recollections of Peter Landin: 1987-2009. High. Order Symb. Comput. 22(4): 299-303 (2009) - Richard Bornat:
Peter Landin: a computer scientist who inspired a generation. High. Order Symb. Comput. 22(4): 295-298 (2009) - Jean Bresson, Carlos Agón, Gérard Assayag:
Visual Lisp/CLOS programming in OpenMusic. High. Order Symb. Comput. 22(1): 81-111 (2009) - Tony Clark:
Stories about calculations: remembering Peter Landin. High. Order Symb. Comput. 22(4): 331-332 (2009) - Olivier Danvy:
Peter J. Landin (1930-2009). High. Order Symb. Comput. 22(2): 191-195 (2009) - Olivier Danvy, Julian A. Padget:
Editorial. High. Order Symb. Comput. 22(1): 1 (2009) - Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 22(2): 113 (2009) - Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 22(3): 197 (2009) - Olivier Danvy, Carolyn L. Talcott:
Editorial. High. Order Symb. Comput. 22(4): 293 (2009) - Zaynah Dargaye, Xavier Leroy:
A verified framework for higher-order uncurrying optimizations. High. Order Symb. Comput. 22(3): 199-231 (2009) - Kevin Hammond, Greg Michaelson:
The Peter Landin prize. High. Order Symb. Comput. 22(4): 305-312 (2009) - Tom Hirschowitz, Xavier Leroy, J. B. Wells:
Compilation of extended recursion in call-by-value functional languages. High. Order Symb. Comput. 22(1): 3-66 (2009) - Patricia Johann, Neil Ghani:
A principled approach to programming with nested types in Haskell. High. Order Symb. Comput. 22(2): 155-189 (2009) - Peter J. Landin:
Getting rid of labels. High. Order Symb. Comput. 22(4): 315-329 (2009) - Peter J. Landin:
Calculations. High. Order Symb. Comput. 22(4): 333-359 (2009) - David Monniaux:
A minimalistic look at widening operators. High. Order Symb. Comput. 22(2): 145-154 (2009)