Zobrazeno 1 - 10
of 57
pro vyhledávání: '"Cimini, Matteo"'
Autor:
Cimini, Matteo
Program logics are a powerful formal method in the context of program verification. Can we develop a counterpart of program logics in the context of language verification? This paper proposes language logics, which allow for statements of the form $\
Externí odkaz:
http://arxiv.org/abs/2408.01515
Autor:
Cimini, Matteo
Publikováno v:
EPTCS 378, 2023, pp. 14-25
Rule formats can quickly establish meta-theoretic properties of process algebras. It is then desirable to identify domain-specific languages (DSLs) that can easily express rule formats. In prior work, we have developed Lang-n-Change, a DSL that inclu
Externí odkaz:
http://arxiv.org/abs/2304.06397
Autor:
Cecere, Donato1 (AUTHOR) donato.cecere@enea.it, Cimini, Matteo1 (AUTHOR) matteo.cimini@enea.it, Carpenella, Simone2 (AUTHOR) simone.carpenella@uniroma3.it, Caldarelli, Jan2 (AUTHOR) jan.caldarelli@stud.uniroma3.it, Giacomazzi, Eugenio1 (AUTHOR) eugenio.giacomazzi@enea.it
Publikováno v:
Energies (19961073). Oct2024, Vol. 17 Issue 20, p5032. 21p.
Autor:
Cimini, Matteo
Publikováno v:
EPTCS 365, 2022, pp. 69-84
In prior work, Cimini has presented Lang-n-Send, a pi-calculus with language definitions. In this paper, we present an extension of this calculus called Lang-n-Send+m. First, we revise Lang-n-Send to work with transition system specifications rather
Externí odkaz:
http://arxiv.org/abs/2208.04635
Autor:
Cimini, Matteo
Publikováno v:
EPTCS 356, 2022, pp. 46-56
We present Lang-n-Send, a pi-calculus that is equipped with language definitions. Processes can define languages in operational semantics, and use them to execute programs. Furthermore, processes can send and receive pieces of operational semantics t
Externí odkaz:
http://arxiv.org/abs/2203.12879
Autor:
Cimini, Matteo, Mourad, Benjamin
Publikováno v:
EPTCS 339, 2021, pp. 43-58
Language transformations are algorithms that take a language specification in input, and return the language specification modified. Language transformations are useful for automatically adding features such as subtyping to programming languages (PLs
Externí odkaz:
http://arxiv.org/abs/2108.10493
A delayed detached eddy simulation of a sub-scale cold-gas dual-bell nozzle flow at high Reynolds number and in sea-level mode is carried out at nozzle pressure ratio NPR=45.7. In this regime the over-expanded flow exhibits a symmetric and controlled
Externí odkaz:
http://arxiv.org/abs/2005.00037
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.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mourad, Benjamin, Cimini, Matteo
In this paper we propose a calculus for expressing algorithms for programming languages transformations. We present the type system and operational semantics of the calculus, and we prove that it is type sound. We have implemented our calculus, and w
Externí odkaz:
http://arxiv.org/abs/1910.11924
Autor:
Cimini, Matteo
Publikováno v:
EPTCS 304, 2019, pp. 61-76
Gradual typing is an approach to integrating static and dynamic typing within the same language, and puts the programmer in control of which regions of code are type checked at compile-time and which are type checked at run-time. In this paper, we fo
Externí odkaz:
http://arxiv.org/abs/1909.05971