Outline

  1. Title
  2. Outline
  3. Announcing Common Larceny
  4. Promoting Common Larceny
  5. Interoperability (part 0)
  6. JavaDot syntax
  7. JavaDot example
  8. Common Larceny is compiler-based
  9. Under the Hood
  10. The Larceny Project
  11. The Larceny Project: Back Ends
  12. Twobit: example
  13. Twobit: A-normal form
  14. Twobit: MacScheme machine code
  15. Twobit: SPARC machine code
  16. Twobit: ANSI C code
  17. Twobit: IL code
  18. Weird language features
  19. Weird target misfeatures
  20. Integer arithmetic
  21. Generic arithmetic
  22. Pure OO
  23. Interoperability (part 1)
  24. Control structures
  25. Continuations as objects
  26. Interoperability (part 2)
  27. Block structure
  28. Guaranteed asymptotic space complexity
  29. Experimental Science
  30. Pentium Benchmarks (1 of 4)
  31. Pentium Benchmarks (2 of 4)
  32. Pentium Benchmarks (3 of 4)
  33. Pentium Benchmarks (4 of 4)
  34. Sparc Benchmarks (1 of 4)
  35. Sparc Benchmarks (2 of 4)
  36. Sparc Benchmarks (3 of 4)
  37. Sparc Benchmarks (4 of 4)
  38. Types Rant
  39. Types Rant
  40. Types Rant
  41. Types Rant
  42. Types Rant
  43. Types Rant
  44. Expressive Types
  45. Coproducts and the CTS
  46. Status of Common Larceny
  47. Compiling and Running the nboyer4 Benchmark
  48. Compiling and Running the nboyer4 Benchmark
  49. The Larceny Gang

Lecture given at the International Lisp Conference (ILC 2005), Stanford University, 22 June 2005. Links remain to several auxiliary slides that were not used in the talk, but those slides have been removed.

For best results, set your browser to display text at 36pt or thereabouts.