Justification Logic as a foundation for certifying mobile computation
- Autores
- Bonelli, Eduardo; Feller, Federico
- Año de publicación
- 2012
- Idioma
- inglés
- Tipo de recurso
- artículo
- Estado
- versión publicada
- Descripción
- We explore an intuitionistic fragment of Artëmov's Justification Logic as a type system for a programming language for mobile units. Such units consist of both a code and a certificate component. Our language, the Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system additionally ensures correct certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.
Facultad de Informática - Materia
-
Ciencias Informáticas
Curry-de Bruijn-Howard isomorphism
Justification Logic
Mobile computation
Typed lambda calculus
Lógica - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by/4.0/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/84399
Ver los metadatos del registro completo
| id |
SEDICI_40f706d4a967aea544395bb948a040fb |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/84399 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
Justification Logic as a foundation for certifying mobile computationBonelli, EduardoFeller, FedericoCiencias InformáticasCurry-de Bruijn-Howard isomorphismJustification LogicMobile computationTyped lambda calculusLógicaWe explore an intuitionistic fragment of Artëmov's Justification Logic as a type system for a programming language for mobile units. Such units consist of both a code and a certificate component. Our language, the Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system additionally ensures correct certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine.Facultad de Informática2012-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf935-950http://sedici.unlp.edu.ar/handle/10915/84399enginfo:eu-repo/semantics/altIdentifier/issn/0168-0072info:eu-repo/semantics/altIdentifier/doi/10.1111/j.1574-695x.2012.00985.xinfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/Creative Commons Attribution 4.0 International (CC BY 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-22T16:56:52Zoai:sedici.unlp.edu.ar:10915/84399Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-22 16:56:53.138SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
Justification Logic as a foundation for certifying mobile computation |
| title |
Justification Logic as a foundation for certifying mobile computation |
| spellingShingle |
Justification Logic as a foundation for certifying mobile computation Bonelli, Eduardo Ciencias Informáticas Curry-de Bruijn-Howard isomorphism Justification Logic Mobile computation Typed lambda calculus Lógica |
| title_short |
Justification Logic as a foundation for certifying mobile computation |
| title_full |
Justification Logic as a foundation for certifying mobile computation |
| title_fullStr |
Justification Logic as a foundation for certifying mobile computation |
| title_full_unstemmed |
Justification Logic as a foundation for certifying mobile computation |
| title_sort |
Justification Logic as a foundation for certifying mobile computation |
| dc.creator.none.fl_str_mv |
Bonelli, Eduardo Feller, Federico |
| author |
Bonelli, Eduardo |
| author_facet |
Bonelli, Eduardo Feller, Federico |
| author_role |
author |
| author2 |
Feller, Federico |
| author2_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Curry-de Bruijn-Howard isomorphism Justification Logic Mobile computation Typed lambda calculus Lógica |
| topic |
Ciencias Informáticas Curry-de Bruijn-Howard isomorphism Justification Logic Mobile computation Typed lambda calculus Lógica |
| dc.description.none.fl_txt_mv |
We explore an intuitionistic fragment of Artëmov's Justification Logic as a type system for a programming language for mobile units. Such units consist of both a code and a certificate component. Our language, the Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system additionally ensures correct certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine. Facultad de Informática |
| description |
We explore an intuitionistic fragment of Artëmov's Justification Logic as a type system for a programming language for mobile units. Such units consist of both a code and a certificate component. Our language, the Certifying Mobile Calculus, caters for code and certificate development in a unified theory. In the same way that mobile code is constructed out of code components and extant type systems track local resource usage to ensure the mobile nature of these components, our system additionally ensures correct certificate construction out of certificate components. We present proofs of type safety and strong normalization for a run-time system based on an abstract machine. |
| publishDate |
2012 |
| dc.date.none.fl_str_mv |
2012-07 |
| dc.type.none.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion Articulo http://purl.org/coar/resource_type/c_6501 info:ar-repo/semantics/articulo |
| format |
article |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/84399 |
| url |
http://sedici.unlp.edu.ar/handle/10915/84399 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/issn/0168-0072 info:eu-repo/semantics/altIdentifier/doi/10.1111/j.1574-695x.2012.00985.x |
| dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International (CC BY 4.0) |
| eu_rights_str_mv |
openAccess |
| rights_invalid_str_mv |
http://creativecommons.org/licenses/by/4.0/ Creative Commons Attribution 4.0 International (CC BY 4.0) |
| dc.format.none.fl_str_mv |
application/pdf 935-950 |
| dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
| reponame_str |
SEDICI (UNLP) |
| collection |
SEDICI (UNLP) |
| instname_str |
Universidad Nacional de La Plata |
| instacron_str |
UNLP |
| institution |
UNLP |
| repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
| repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
| _version_ |
1846783178028613632 |
| score |
12.982451 |