Výsledky vyhledávání - "name binding"

Akademický článek

Lightweight Routing Protocol for Named Data Networking

Autor: ZOU Bowen, SONG Tian, LI Tianlong, YANG Yating

Publikováno v: Jisuanji kexue yu tansuo, Vol 18, Iss 3, Pp 795-804 (2024)

Named data networking (NDN) is a novel network architecture that revolves around information-centric principles. In order to acquire global routing information within the network, typical NDN routing protocols rely on data synchronization mechanisms

Externí odkaz: https://doaj.org/article/de317972d585458da17e31c51de54ecf

Zobrazit plný text záznamu

Locally Nameless Sets

Autor: Pitts, AM

Publikováno v: Proceedings of the ACM on Programming Languages. 7:488-514

This paper provides a new mathematical foundation for the locally nameless representation of syntax with binders, one informed by nominal techniques. It gives an equational axiomatization of two key locally nameless operations, "variable opening" and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75c28e9735bd81ab0ae43a697221cedb
https://doi.org/10.1145/3571210

Zobrazit plný text záznamu

Incremental type-checking for free: using scope graphs to derive incremental type-checkers

Autor: Hendrik Van Antwerpen, Eelco Visser, Aron Zwaan

Publikováno v: Proceedings of the ACM on Programming Languages, 6(OOPSLA2)

Fast analysis response times in IDEs are essential for a good editor experience. Incremental type-checking can provide that in a scalable fashion. However, existing techniques are not reusable between languages. Moreover, mutual and dynamic dependenc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5676875b7d4b8cd26721786ddf674ec
https://doi.org/10.1145/3563303

Zobrazit plný text záznamu

Scope Graphs

Autor: Zwaan, A.S., van Antwerpen, H., Lammel, Ralf, Mosses, Peter D., Steimann, Friedrich

Publikováno v: Eelco Visser Commemorative Symposium, EVCS 2023

Static name binding (i.e., associating references with appropriate declarations) is an essential aspect of programming languages. However, it is usually treated in an unprincipled manner, often leaving a gap between formalization and implementation.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cf1afc5961249778730343ad87bdda9
http://resolver.tudelft.nl/uuid:3024d587-7c5d-44bd-8471-27b7c2e59160

Zobrazit plný text záznamu

Stack Graphs: Name Resolution at Scale

Autor: Creager, Douglas A., van Antwerpen, Hendrik

We present stack graphs, an extension of Visser et al.’s scope graphs framework. Stack graphs power Precise Code Navigation at GitHub, allowing users to navigate name binding references both within and across repositories. Like scope graphs, stack

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36c4311acc2b7692bdf3e9b9db7ba652

Zobrazit plný text záznamu

Revisiting Graph Types in HyperLMNtal: A Modeling Language for Hypergraph Rewriting

Autor: Kazunori Ueda, Alimujiang Yasen

Publikováno v: IEEE Access, Vol 9, Pp 133449-133460 (2021)

Hypergraphs are a highly expressive data structure for modeling and programming, for which high-level language constructs are yet to be established. HyperLMNtal is a modeling language based on hypergraph rewriting. Rewrite rules can copy and remove s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::644821324fcf4455ca0d095958d82c63
https://ieeexplore.ieee.org/document/9537805/

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Knowing when to ask: sound scheduling of name resolution in type checkers derived from declarative specifications

Autor: Arjen Rouvoet, Hendrik van Antwerpen, Casper Bach Poulsen, Eelco Visser, Robbert Krebbers

Publikováno v: Proceedings of the ACM on Programming Languages, 4, 1-28
Proceedings of the ACM on Programming Languages, 4(OOPSLA)
Proceedings of the ACM on Programming Languages, 4, OOPSLA, pp. 1-28

There is a large gap between the specification of type systems and the implementation of their type checkers, which impedes reasoning about the soundness of the type checker with respect to the specification. A vision to close this gap is to automati

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c78da2333093d35e4690d0bf5d305431
http://hdl.handle.net/2066/228333

Zobrazit plný text záznamu

Automata Learning

Autor: Lutz Schröder, Henning Urbat

Publikováno v: LICS

We propose a generic categorical framework for learning unknown formal languages of various types (e.g. finite or infinite words, weighted and nominal languages). Our approach is parametric in a monad T that represents the given type of languages and

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1bbadb7fe0a07ea03bedcdbd0214eb27
https://doi.org/10.1145/3373718.3394775

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání