Engineering Grammar-Based Type Checking for Graph Rewriting Languages

Autor: Naoki Yamamoto, Kazunori Ueda

Publikováno v: IEEE Access, Vol 10, Pp 114612-114628 (2022)

The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concur

Externí odkaz: https://doaj.org/article/1ae9dcae4e4946259e27acedb86b5f3d

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

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

Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting

Autor: Michael Färber

Publikováno v: 11th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’22)
11th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’22), Jan 2022, Philadelphia, PA, United States. ⟨10.1145/3497775.3503683⟩

Several proof assistants, such as Isabelle or Coq, can concurrently check multiple proofs. In contrast, the vast majority of today's small proof checkers either does not support concurrency at all or only limited forms thereof, restricting the effici

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cddaf3514c7efb51783a8e3c025fc24
https://doi.org/10.1145/3497775.3503683

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