Outline
- Title
- Outline
- Announcing Common Larceny
- Promoting Common Larceny
- Interoperability (part 0)
- JavaDot syntax
- JavaDot example
- Common Larceny is compiler-based
- Under the Hood
- The Larceny Project
- The Larceny Project: Back Ends
- Twobit: example
- Twobit: A-normal form
- Twobit: MacScheme machine code
- Twobit: SPARC machine code
- Twobit: ANSI C code
- Twobit: IL code
- Weird language features
- Weird target misfeatures
- Integer arithmetic
- Generic arithmetic
- Pure OO
- Interoperability (part 1)
- Control structures
- Continuations as objects
- Interoperability (part 2)
- Block structure
- Guaranteed asymptotic space complexity
- Experimental Science
- Pentium Benchmarks (1 of 4)
- Pentium Benchmarks (2 of 4)
- Pentium Benchmarks (3 of 4)
- Pentium Benchmarks (4 of 4)
- Sparc Benchmarks (1 of 4)
- Sparc Benchmarks (2 of 4)
- Sparc Benchmarks (3 of 4)
- Sparc Benchmarks (4 of 4)
- Types Rant
- Types Rant
- Types Rant
- Types Rant
- Types Rant
- Types Rant
- Expressive Types
- Coproducts and the CTS
- Status of Common Larceny
- Compiling and Running the nboyer4 Benchmark
- Compiling and Running the nboyer4 Benchmark
- 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.