Publicaciones
- A. Abel, T. Coquand, and M. Pagano, “A modular type-checking algorithm for type theory with singleton types and proof irrelevance,” in Typed Lambda Calculi and Applications, 9th International Conference, TLCA 2009, Brasilia, Brazil, July 1-3, 2009. Proceedings, 2009, pp. 5–19.
- M. Pagano, “Ontological commitments of computer science,” in Proceedings IACAP 2011 - First International Conference of IACAP: The Computational Turn: Past, Presents, futures? 4 – 6 july, 2011, Aarhus University, 2011, pp. 56–59.
- A. Abel, T. Coquand, and M. Pagano, “A modular type-checking algorithm for type theory with singleton types and proof irrelevance,” Logical Methods in Computer Science, vol. 7, no. 2:4, pp. 1–57, May 2011 [Online]. Available at: http://arxiv.org/pdf/1102.2405
- L. Rodríguez, D. Fridlender, and M. Pagano, “A certified extension of the krivine machine for a call-by-name higher-order imperative language,” in 19th international conference on types for proofs and programs, TYPES 2013, april 22-26, 2013, toulouse, france, 2013, vol. 26, pp. 230–250 [Online]. Available at: http://dx.doi.org/10.4230/LIPIcs.TYPES.2013.230
- M. Pagano, “Type-checking and normalisation by evaluation for dependent type systems,” PhD thesis, Universidad Nacional de Córdoba, 2012 [Online]. Available at: http://www.famaf.unc.edu.ar/publicaciones/documents/serie_d/DComp4.pdf
- D. Fridlender and M. Pagano, “PTS with typed equality and explicit substitutions.” Presentación en Types for Proofs and Programs 2011, Septiembre-2011.
- L. Rodríguez, “Generación de código intermedio usando semántica funtorial,” Master’s thesis, FaMAF - Universidad Nacional de Córdoba, 2010 [Online]. Available at: http://www.famaf.unc.edu.ar/institucional/biblioteca/trabajos/638/15762.pdf
- L. Rodríguez, D. Fridlender, and M. Pagano, “Mechanized semantics for an Algol-like language.” Presentación en Types for Proofs and Programs 2013 a cargo de Leonardo Rodríguez, Abril-2013.
- D. Fridlender and M. Pagano, “A type-checking algorithm for martin-löf type theory with subtyping based on normalisation by evaluation,” in TLCA, 2013, vol. 7941, pp. 140–155.
- A. Acosta, R. Cherini, A. Gadea, E. Gunther, L. Losano, and M. Pagano, “FUN : una herramienta didáctica para la derivación de programas funcionales,” in XIX congreso argentino de ciencias de la computación - iI workshop de innovación en educación en informática, 2013.
- D. Fridlender, “A proof-irrelevant model of martin-löf’s logical framework,” Mathematical Structures in Computer Science, vol. 12, no. 6, pp. 771–795, 2002 [Online]. Available at: http://dx.doi.org/10.1017/S0960129502003766
- D. Fridlender and M. Indrika, “Do we need dependent types?” J. Funct. Program., vol. 10, no. 4, pp. 409–415, 2000 [Online]. Available at: http://journals.cambridge.org/action/displayAbstract?aid=59741
- D. Fridlender, “An interpretation of the fan theorem in type theory,” in Types for proofs and programs, international workshop TYPES ’98, kloster irsee, germany, march 27-31, 1998, selected papers, 1998, vol. 1657, pp. 93–105 [Online]. Available at: http://dx.doi.org/10.1007/3-540-48167-2_7
- D. Fridlender, “Highman’s lemma in theory,” in Types for proofs and programs, international workshop tYPES’96, aussois, france, december 15-19, 1996, selected papers, 1996, vol. 1512, pp. 112–133 [Online]. Available at: http://dx.doi.org/10.1007/BFb0097789