papers.txt

   1 GADT:
   2 http://research.microsoft.com/users/simonpj/papers/gadt/
   3 http://www.cs.pdx.edu/~sheard/OmegaHaskellWkShp_files/
   4
   5 Type inference:
   6 haskell.org -> Pople -> Mark Jones, Peyton Jones
   7
   8 Gente trabajando en diseño de lenguajes:
   9 http://www.cs.cmu.edu/~mleone/language-people.html
  10
  11 Metaprogramacion:
  12 http://en.wikipedia.org/wiki/Metaprogramming
  13 http://en.wikipedia.org/wiki/Language_Oriented_Programming
  14 http://www.onboard.jetbrains.com/is1/articles/04/10/lop/index.html
  15 http://www.jetbrains.com/mps/
  16 http://opencxx.sourceforge.net/
  17 http://introspector.sourceforge.net/
  18
  19 Concept Programming (copado):
  20 http://xlr.sourceforge.net/
  21
  22 Diapos sobre construcción de DSL usando OCaml + C:
  23 http://www.venge.net/graydon/talks/mkc/html/index.html
  24
  25 Sintaxis en distintos lenguajes:
  26 http://merd.sourceforge.net/pixel/language-study/syntax-across-languages/
  27
  28 GC Bohem:
  29 http://www.hpl.hp.com/techreports/2001/HPL-2001-251.html
  30
  31 GC VZOOM:
  32 http://www.digitalmars.com/webnews/newsgroups.php?art_group=digitalmars.D&article_id=44880
  33 http://home.comcast.net/~vzoom/
  34 http://home.comcast.net/~vzoom/demos/pc_sample.c
  35
  36 GC CBGC (Connectivity-based garbage collection):
  37 http://portal.acm.org/citation.cfm?id=949337&coll=GUIDE&dl=ACM&CFID=6079566&CFTOKEN=11708043
  38 http://www.cs.colorado.edu/%7Ediwan/cbgc.pdf
  39
  40 Más papers de los autores de CBGC:
  41 http://www-cs.canisius.edu/~hertzm/
  42 http://www-plan.cs.colorado.edu/diwan/recentpapers.htm#Memory%20Management
  43 http://domino.research.ibm.com/comm/research_people.nsf/pages/hirzel.index.html#papers
  44
  45 Hard Real-Time Garbage Collection in the Jamaica Virtual Machine:
  46 http://www.aicas.com/papers/rtcsa99_fsiebert.pdf
  47 http://www.aicas.com/papers/jugs_7-Feb-2000_slides.pdf
  48
  49 Hard Real-Time Reference Counting without External Fragmentation:
  50 http://www.ritzau.se/liu/papers/etaps2001.ps
  51
  52 Traditional GCs perform poorly when memory gets tight: some of the page
  53 managed by the GC gets evicted to the disk by the Virtual memory Manager
  54 (VM) of the OS, but when the GC does a garbage collection run, it will
  55 swap in the evicted page which will cause the VM to evict another page,
  56 etc.
  57
  58 The Bookmarking Collector (BC) is a GC which communicates with the VM to
  59 select the page to evict to avoid this memory trashing, it necessitates
  60 a (small) patch to the OS so that the VM and the GC can communicate,
  61 but the results are impressive compared to traditional GCs when there
  62 is memory pressure: improved runtime and reduced pause (even if BC is
  63 not a realtime GC).
  64
  65 Here's the link to the video presentation (too bad,
  66 the questions at the end are difficult to hear):
  67 http://content.digitalwell.washington.edu/msr/external_release_talks_12_05_2005/12631/lecture.htm
  68
  69 And the paper: http://www.cs.umass.edu/~emery/pubs/f034-hertz.pdf
  70
  71
  72 BC is a moving memory GC implemented in a JVM, so the results are not
  73 directly applicable to D, there's a non-moving variant of BC studied in
  74 the paper it gets nearly as good runtime as BC, but the pause are not
  75 as good.
  76