La información se actualiza semanalmente dentro de cada facultad, instituto y departamento. Se muestra en orden cronológico descendente por fecha de difusión de la noticia y alfabético por autor.
En “Ver más publicaciones” se puede ampliar la búsqueda mediante el uso filtros.
Artículos arbitrados publicados en publicaciones arbitradas
-
https://doi.org/10.1017/S0960129521000335Copello, E., Szasz, N., & Tasistro, Á. (2021). Formalization of metatheory of the Lambda Calculus in constructive type theory using the Barendregt variable convention. Mathematical Structures in Computer Science, 31(3), 341-360.
-
https://doi.org/10.1016/j.entcs.2020.08.010Urciuoli, S., Tasistro, Á., & Szasz, N. (2020). Strong normalization for the simply-typed lambda calculus in constructive type theory using Agda. Electronic Notes in Theoretical Computer Science, 351, 187-203.
-
https://doi.org/10.1016/j.entcs.2018.10.006Copello, E., Szasz, N., & Tasistro, Á. (2018). Machine-checked proof of the Church-Rosser theorem for lambda-calculus using the Barendregt variable convention in constructive type theory. Electronic Notes in Theoretical Computer Science (ENTCS), 338, 79-95.
-
https://doi.org/10.1016/j.tcs.2016.08.025Copello, E., Szasz, N., & Tasistro, Á. (2017). Formal metatheory of the Lambda calculus using Stoughton’s substitution. Theoretical Computer Science, 685, 65-85.
-
https://doi.org/10.1016/j.entcs.2016.06.008Copello, E., Tasistro, Á., Szasz, N., Bove, A., & Fernández, M. (2016). Alpha-structural induction and recursion for the lambda calculus in constructive type theory. Electronic Notes in Theoretical Computer Science, 323, 109-124.
-
https://doi.org/10.1016/j.scico.2016.02.003Calegari, D., Mossakowski, T., & Szasz, N. (2016). Heterogeneous verification in the context of model driven engineering. Science of Computer Programming, 126, 3-30.
-
https://doi.org/10.1016/j.scico.2015.02.006Calegari, D., & Szasz, N. (2015). Institution-based foundations for verification in the context of model-driven engineering. Science of Computer Programming, 107-108, 41-63.
-
https://doi.org/10.1016/j.entcs.2015.04.013Tasistro, Á., Copello, E., & Szasz, N. (2015). Formalisation in constructive type theory of stoughton’s substitution for the lambda calculus. Electronic Notes in Theoretical Computer Science, 312, 215-230.
-
https://doi.org/10.1109/TLA.2014.6894009González, A., Luna, C., Zorzan, F., & Szasz, N. (2014). Automatic derivation of behavior of products in a software product line. IEEE Latin America Transactions, 12(6), 1120-1126.
-
Recuperado de https://www.cscjournals.org/library/manuscriptinfo.php?mc=IJLP-26Tasistro, Á., Copello, E., & Szasz, N. (2012). Principal type scheme for session types. International Journal of Logic and Computation, 3(1), 34-43.