Published in: LIPIcs, Volume 136, 3rd Summit on Advances in Programming Languages (SNAPL 2019)
Michael Greenberg. The Dynamic Practice and Static Theory of Gradual Typing. In 3rd Summit on Advances in Programming Languages (SNAPL 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 136, pp. 6:1-6:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{greenberg:LIPIcs.SNAPL.2019.6, author = {Greenberg, Michael}, title = {{The Dynamic Practice and Static Theory of Gradual Typing}}, booktitle = {3rd Summit on Advances in Programming Languages (SNAPL 2019)}, pages = {6:1--6:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-113-9}, ISSN = {1868-8969}, year = {2019}, volume = {136}, editor = {Lerner, Benjamin S. and Bod{\'\i}k, Rastislav and Krishnamurthi, Shriram}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SNAPL.2019.6}, URN = {urn:nbn:de:0030-drops-105495}, doi = {10.4230/LIPIcs.SNAPL.2019.6}, annote = {Keywords: dynamic typing, gradual typing, static typing, implementation, theory, challenge problems} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Matthias U. Horn. Optimal algorithms for global optimization in case of unknown Lipschitz constant. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{horn:DagSemProc.04401.11, author = {Horn, Matthias U.}, title = {{Optimal algorithms for global optimization in case of unknown Lipschitz constant}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.11}, URN = {urn:nbn:de:0030-drops-1430}, doi = {10.4230/DagSemProc.04401.11}, annote = {Keywords: Global optimization , Lipschitz functions , optimal rate of convergence , complexity} }
Feedback for Dagstuhl Publishing