GADT: http://research.microsoft.com/users/simonpj/papers/gadt/ http://www.cs.pdx.edu/~sheard/OmegaHaskellWkShp_files/ Type inference: haskell.org -> Pople -> Mark Jones, Peyton Jones Gente trabajando en diseño de lenguajes: http://www.cs.cmu.edu/~mleone/language-people.html Metaprogramacion: http://en.wikipedia.org/wiki/Metaprogramming http://en.wikipedia.org/wiki/Language_Oriented_Programming http://www.onboard.jetbrains.com/is1/articles/04/10/lop/index.html http://www.jetbrains.com/mps/ http://opencxx.sourceforge.net/ http://introspector.sourceforge.net/ Concept Programming (copado): http://xlr.sourceforge.net/ Diapos sobre construcción de DSL usando OCaml + C: http://www.venge.net/graydon/talks/mkc/html/index.html Sintaxis en distintos lenguajes: http://merd.sourceforge.net/pixel/language-study/syntax-across-languages/ GC Bohem: http://www.hpl.hp.com/techreports/2001/HPL-2001-251.html GC VZOOM: http://www.digitalmars.com/webnews/newsgroups.php?art_group=digitalmars.D&article_id=44880 http://home.comcast.net/~vzoom/ http://home.comcast.net/~vzoom/demos/pc_sample.c GC CBGC (Connectivity-based garbage collection): http://portal.acm.org/citation.cfm?id=949337&coll=GUIDE&dl=ACM&CFID=6079566&CFTOKEN=11708043 http://www.cs.colorado.edu/%7Ediwan/cbgc.pdf Más papers de los autores de CBGC: http://www-cs.canisius.edu/~hertzm/ http://www-plan.cs.colorado.edu/diwan/recentpapers.htm#Memory%20Management http://domino.research.ibm.com/comm/research_people.nsf/pages/hirzel.index.html#papers Hard Real-Time Garbage Collection in the Jamaica Virtual Machine: http://www.aicas.com/papers/rtcsa99_fsiebert.pdf http://www.aicas.com/papers/jugs_7-Feb-2000_slides.pdf Hard Real-Time Reference Counting without External Fragmentation: http://www.ritzau.se/liu/papers/etaps2001.ps Traditional GCs perform poorly when memory gets tight: some of the page managed by the GC gets evicted to the disk by the Virtual memory Manager (VM) of the OS, but when the GC does a garbage collection run, it will swap in the evicted page which will cause the VM to evict another page, etc. The Bookmarking Collector (BC) is a GC which communicates with the VM to select the page to evict to avoid this memory trashing, it necessitates a (small) patch to the OS so that the VM and the GC can communicate, but the results are impressive compared to traditional GCs when there is memory pressure: improved runtime and reduced pause (even if BC is not a realtime GC). Here's the link to the video presentation (too bad, the questions at the end are difficult to hear): http://content.digitalwell.washington.edu/msr/external_release_talks_12_05_2005/12631/lecture.htm And the paper: http://www.cs.umass.edu/~emery/pubs/f034-hertz.pdf BC is a moving memory GC implemented in a JVM, so the results are not directly applicable to D, there's a non-moving variant of BC studied in the paper it gets nearly as good runtime as BC, but the pause are not as good.