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.19153/cleiej.26.1.6Solsona, J. E., Tasistro, Á., & Yovine, S. (2023). On the specification and verification of the PCR parallel programming pattern in TLA+. CLEI Eletronic Journal (CLEIej), 26(1), 16 p.
-
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.
-
Recuperado de https://soche.cl/chjs/volumes/12/ChJS-12-01-02.pdfLópez Vázquez, C., Tasistro, A., & Hochsztain, E. (2021). Exact tables for the Friedman rank test: Case with ties. Chilean Journal of Statistics , 12(1), 23-35.
-
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, 658, 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.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.18294/relais.2013.153-166Moreno, S., Tasistro, Á., & Vallespir, D. (2013). PSPvdc: una propuesta que incorpora el Diseño por Contrato Verificado al Personal Software Process. Revista Latinoamericana de Ingeniería de Software, 1(5), 153-166.
-
https://doi.org/10.3217/jucs-019-11-1570Pais, J., & Tasistro, Á. (2013). Proof assistant based on didactic considerations. Journal of Universal Computer Science (J.UCS), 19(11), 1570-1596.