default search action
Higher-Order and Symbolic Computation, Volume 19
Volume 19, Number 1, March 2006
- Olivier Danvy, Oege de Moor, Julian A. Padget, Peter Thiemann:
Editorial. 5 - Matthieu Martel:
Semantics of roundoff error propagation in finite precision calculations. 7-30 - Antoine Miné:
The octagon abstract domain. 31-100 - V. Krishna Nandivada, Suresh Jagannathan:
Dynamic state restoration using versioning exceptions. 101-124 - François Pottier, Nadji Gauthier:
Polymorphic typed defunctionalization and concretization. 125-162
Volume 19, Numbers 2-3, September 2006
- Furio Honsell, Carolyn L. Talcott:
Editorial. 167-168 - Michael Norrish:
Mechanising lambda-calculus using a classical first order theory of terms with permutations. 169-195 - Jason Hickey, Aleksey Nogin:
Formal compiler construction in a logical framework. 197-230 - Makoto Hamana:
An initial algebra approach to term rewriting systems with variable binders. 231-262 - Neil Ghani, Tarmo Uustalu, Makoto Hamana:
Explicit substitutions and higher-order syntax. 263-282 - Fabio Gadducci, Marino Miculan, Ugo Montanari:
About permutation algebras, (pre)sheaves and named sets. 283-304 - Miki Tanaka, John Power:
Pseudo-distributive laws and axiomatics for variable binding. 305-337
Volume 19, Number 4, December 2006
- Olivier Danvy, Andrzej Filinski, Jean-Louis Giavitto, Andy King, Pierre-Etienne Moreau, Carolyn L. Talcott:
Editorial. 343-344 - Clara Bertolissi, Horatiu Cirstea, Claude Kirchner:
Expressing combinatory reduction systems derivations in the rewriting calculus. 345-376 - Paul Blain Levy:
Call-by-push-value: Decomposing call-by-value and call-by-name. 377-414 - Patricia M. Hill, Fausto Spoto:
Deriving escape analysis by abstract interpretation. 415-463
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.