1 | -- | 0 | Thomas Knight Jr.. Conservation of information: applications in functional, reversible, and quantum computing |
3 | -- | 13 | Bastiaan Heeren, Jurriaan Hage, S. Doaitse Swierstra. Scripting the type inference process |
15 | -- | 26 | Matthias Neubauer, Peter Thiemann. Discriminative sum types locate the source of type errors |
27 | -- | 38 | Didier Le Botlan, Didier Rémy. ML:::F:::: raising ML to the power of system F |
39 | -- | 50 | Vincent Simonet. An extension of HM(X) with bounded existential and universal data-types |
51 | -- | 63 | Véronique Benzaken, Giuseppe Castagna, Alain Frisch. CDuce: an XML-centric general-purpose language |
65 | -- | 77 | Michael Y. Levin. Compiling regular patterns |
79 | -- | 86 | Rex L. Page. Software is discrete mathematics |
87 | -- | 98 | James J. Leifer, Gilles Peskine, Peter Sewell, Keith Wansbrough. Global abstraction-safe marshalling with hash types |
99 | -- | 110 | Gavin M. Bierman, Michael Hicks, Peter Sewell, Gareth Stoyle, Keith Wansbrough. Dynamic rebinding for marshalling and update, with destruct-time ? |
111 | -- | 123 | Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano. Iterative-free program analysis |
125 | -- | 0 | Harry G. Mairson. From Hilbert space to Dilbert space: context semantics as a language for games and flow analysis |
127 | -- | 139 | David Walker, Steve Zdancewic, Jay Ligatti. A theory of aspects |
141 | -- | 152 | Andres Löh, Dave Clarke, Johan Jeuring. Dependency-style generic haskell |
153 | -- | 164 | Henrik Nilsson. Functional automatic differentiation with dirac impulses |
165 | -- | 176 | Simon L. Peyton Jones, Alan Blackwell, Margaret M. Burnett. A user-centred approach to functions in Excel |
177 | -- | 188 | Yukiyoshi Kameyama, Masahito Hasegawa. A sound and complete axiomatization of delimited continuations |
189 | -- | 201 | Philip Wadler. Call-by-value is dual to call-by-name |
203 | -- | 211 | Emmanuel Beffara, Vincent Danos. Disjunctive normal forms and local exceptions |
213 | -- | 225 | Yitzhak Mandelbaum, David Walker, Robert Harper. An effective theory of type refinements |
227 | -- | 237 | Tomoyuki Higuchi, Atsushi Ohori. A static type system for JVM access control |
239 | -- | 248 | R. John M. Hughes, S. Doaitse Swierstra. Polish parsers, step by step |
249 | -- | 262 | Geoffrey Washburn, Stephanie Weirich. Boxes go bananas: encoding higher-order abstract syntax with parametric polymorphism |
263 | -- | 274 | Mark R. Shinwell, Andrew M. Pitts, Murdoch J. Gabbay. FreshML: programming with binders made simple |
275 | -- | 286 | Chiyan Chen, Hongwei Xi. Meta-programming through typeful code representation |
287 | -- | 298 | Robert Ennals, Simon L. Peyton Jones. Optimistic evaluation: an adaptive evaluation strategy for non-strict programs |
299 | -- | 300 | Mitchell Wand. Understanding aspects: extended abstract |