Typechecking dependently sorted nominal signatures

Simple item page
datacite.affiliationKing’s College London, UK
datacite.affiliationUniversidad Nacional de Córdoba, Argentina
datacite.affiliationUniversidad ORT Uruguay
dc.creatorFernández, Maribel
dc.creatorPagano, Miguel
dc.creatorSzasz, Nora
dc.creatorTasistro, Álvaro
dc.date.accessioned2025-07-11T19:48:11Z
dc.date.available2025-07-11T19:48:11Z
dc.date.issued2025
dc.descriptionVersión aceptada para publicación.
dc.description.abstractThe authors present a type-checker algorithm for Dependently Sorted Nominal Signatures. They prove its correctness and completeness with respect the sorting system.
dc.description.sponsorshipANII FCE_1_2019_1_156630
dc.format.extent7 p.
dc.format.mimetypePDF
dc.identifier.citationFernández, M., Pagano, M., Szasz, N. & Tasistro, A. (2025). Typechecking dependently sorted nominal signatures. Electronic Proceedings in Theoretical Computer Science (forthcoming volume). International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice. 7 p.
dc.identifier.issn2075-2180
dc.identifier.urihttps://hdl.handle.net/20.500.11968/7202
dc.languageeng
dc.rights.levelAccesso embargado
dc.source10.4204/EPTCS
dc.source.titleElectronic Proceedings in Theoretical Computer Science
dc.subjectNOMINAL TERMS
dc.subjectTYPE-CHEKING
dc.subjectDEPENDENT TYPES
dc.titleTypechecking dependently sorted nominal signatures
dc.typeArtículo
dc.type.versionVersión final del autor
Files
Collections
Publicaciones de proyectos