Difference between revisions of "What the JVM needs"
From JVMLangSummit
Jump to navigationJump to search| Line 1: | Line 1: | ||
== Notes from Rich Hickey's workshop == | == Notes from Rich Hickey's workshop == | ||
| − | |||
| − | |||
=== user mode limitations === | === user mode limitations === | ||
| Line 11: | Line 9: | ||
* fixnums | * fixnums | ||
* need a uniform entry/exit types (Object => boxing) | * need a uniform entry/exit types (Object => boxing) | ||
| + | * Hacker's delight overflow detection is OK (only for add/sub); need a static method that throws overflow-exception? | ||
| + | |||
| + | === storage management === | ||
| + | * floating garbage foo(o, o=null); is tailcall a solution? | ||
| + | |||
| + | === limits === | ||
| + | * 31-bit arrays | ||
| + | * 16-bit instructions | ||
| + | |||
| + | === types === | ||
| + | * structs, value types | ||
Revision as of 11:31, 28 July 2010
Contents
Notes from Rich Hickey's workshop
user mode limitations
- please optimize this
- fences
- typestate: now immutable
numbers
- fixnums
- need a uniform entry/exit types (Object => boxing)
- Hacker's delight overflow detection is OK (only for add/sub); need a static method that throws overflow-exception?
storage management
- floating garbage foo(o, o=null); is tailcall a solution?
limits
- 31-bit arrays
- 16-bit instructions
types
- structs, value types
