Search dblp for Publications

export results for "toc:db/journals/lisp/lisp18.bht:"

 download as .bib file

@article{DBLP:journals/lisp/DanvyHMP05,
  author       = {Olivier Danvy and
                  Fritz Henglein and
                  Harry G. Mairson and
                  Alberto Pettorossi},
  title        = {Editorial},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {5--6},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7001-x},
  doi          = {10.1007/S10990-005-7001-X},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/DanvyHMP05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Davis05,
  author       = {Martin Davis},
  title        = {An Appreciation of Bob Paige},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {13--13},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7004-7},
  doi          = {10.1007/S10990-005-7004-7},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Davis05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/DesharnaisM05,
  author       = {Jules Desharnais and
                  Bernhard M{\"{o}}ller},
  title        = {Least Reflexive Points of Relations},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {51--77},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7006-5},
  doi          = {10.1007/S10990-005-7006-5},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/DesharnaisM05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/DubeF05,
  author       = {Danny Dub{\'{e}} and
                  Marc Feeley},
  title        = {{BIT:} {A} Very Compact Scheme System for Microcontrollers},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {271--298},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4877-4},
  doi          = {10.1007/S10990-005-4877-4},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/DubeF05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/FelleisenLSS05,
  author       = {Matthias Felleisen and
                  Julia Lawall and
                  Manuel Serrano and
                  Olin Shivers},
  title        = {Editorial},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {243--244},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4875-6},
  doi          = {10.1007/S10990-005-4875-6},
  timestamp    = {Mon, 17 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/FelleisenLSS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/GasbichlerS05,
  author       = {Martin Gasbichler and
                  Michael Sperber},
  title        = {Integrating User-Level Threads with Processes in Scsh},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {327--354},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4879-2},
  doi          = {10.1007/S10990-005-4879-2},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/GasbichlerS05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Goldberg05,
  author       = {Mayer Goldberg},
  title        = {A Variadic Extension of Curry's Fixed-Point Combinator},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {371--388},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4881-8},
  doi          = {10.1007/S10990-005-4881-8},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Goldberg05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Goyal05,
  author       = {Deepak Goyal},
  title        = {Transformational Derivation of an Improved Alias Analysis Algorithm},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {15--49},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7005-6},
  doi          = {10.1007/S10990-005-7005-6},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Goyal05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Kiselyov05,
  author       = {Oleg Kiselyov},
  title        = {Implementing Metcast in Scheme},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {355--370},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4880-9},
  doi          = {10.1007/S10990-005-4880-9},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Kiselyov05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Klarlund05,
  author       = {Nils Klarlund},
  title        = {Relativizations for the Logic-Automata Connection},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {79--120},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7007-4},
  doi          = {10.1007/S10990-005-7007-4},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Klarlund05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Mairson05,
  author       = {Harry G. Mairson},
  title        = {Robert Paige {(1947-1999)}},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {7--8},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7002-9},
  doi          = {10.1007/S10990-005-7002-9},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Mairson05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/MeunierFSW05,
  author       = {Philippe Meunier and
                  Robert Bruce Findler and
                  Paul Steckler and
                  Mitchell Wand},
  title        = {Selectors Make Set-Based Analysis Too Hard},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {245--269},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4876-5},
  doi          = {10.1007/S10990-005-4876-5},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/MeunierFSW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Paige05,
  author       = {Robert Paige},
  title        = {An {NSF} Proposal},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {211--235},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7009-2},
  doi          = {10.1007/S10990-005-7009-2},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Paige05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/PettorossiPR05,
  author       = {Alberto Pettorossi and
                  Maurizio Proietti and
                  Sophie Renault},
  title        = {Derivation of Efficient Logic Programs by Specialization and Reduction
                  of Nondeterminism},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {121--210},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7008-3},
  doi          = {10.1007/S10990-005-7008-3},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/PettorossiPR05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/Siegel05,
  author       = {Alan Siegel},
  title        = {Remembrances of Bob Paige},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {1-2},
  pages        = {9--11},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-7003-8},
  doi          = {10.1007/S10990-005-7003-8},
  timestamp    = {Thu, 05 Mar 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/lisp/Siegel05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lisp/WaddellSD05,
  author       = {Oscar Waddell and
                  Dipanwita Sarkar and
                  R. Kent Dybvig},
  title        = {Fixing Letrec: {A} Faithful Yet Efficient Implementation of Scheme's
                  Recursive Binding Construct},
  journal      = {High. Order Symb. Comput.},
  volume       = {18},
  number       = {3-4},
  pages        = {299--326},
  year         = {2005},
  url          = {https://doi.org/10.1007/s10990-005-4878-3},
  doi          = {10.1007/S10990-005-4878-3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/lisp/WaddellSD05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics