Volume 20, Issue 3

Higher-Order and Symbolic Computation is now archived and no longer receiving submissions with this publisher. All articles published in the journal during its time with Springer will remain fully searchable through our websites.

Search all Higher-Order and Symbolic Computation articles

September 2007

10 articles in this issue

Editorial
Olivier Danvy
EditorialNotes 27 October 2007 Pages: 197 - 198
A call-by-name lambda-calculus machine
Jean-Louis Krivine
OriginalPaper 25 October 2007 Pages: 199 - 207
Strongly reducing variants of the Krivine abstract machine
Pierre Crégut
OriginalPaper 24 October 2007 Pages: 209 - 230
On the correctness of the Krivine machine
Mitchell Wand
OriginalPaper 24 October 2007 Pages: 231 - 235
The next 700 Krivine machines
Rémi Douence
Pascal Fradet
OriginalPaper 24 October 2007 Pages: 237 - 255
Explaining the lazy Krivine machine using explicit substitution and addresses
Frédéric Lang
OriginalPaper 24 October 2007 Pages: 257 - 270
Improving the lazy Krivine machine
Daniel P. Friedman
Abdulaziz Ghuloum
Onnie Lynn Winebarger
OriginalPaper 24 October 2007 Pages: 271 - 293
The graphical Krivine machine
Sylvain Lippi
OriginalPaper 27 October 2007 Pages: 295 - 318
State-transition machines for lambda-calculus expressions
David A. Schmidt
OriginalPaper 24 October 2007 Pages: 319 - 332
State-transition machines, revisited
David A. Schmidt
OriginalPaper 24 October 2007 Pages: 333 - 335

Volume 20, Issue 3

Search

Navigation