A proof of weak termination of typed λσ-calculi

Jean Goubault-Larrecq

doi:10.1007/BFb0097790

Conference papers

A proof of weak termination of typed λσ-calculi

Jean Goubault-Larrecq ^{1, 2}

1 GIE Dyade

2 Inria - Institut National de Recherche en Informatique et en Automatique

Document type :

Conference papers

Domain :

Computer Science [cs] / Logic in Computer Science [cs.LO]

Complete list of metadata

https://hal.inria.fr/hal-03211080
Contributor : Jean Goubault-Larrecq <>
Submitted on : Wednesday, April 28, 2021 - 2:12:08 PM
Last modification on : Friday, April 30, 2021 - 3:10:18 AM

A proof of weak termination of typed λσ-calculi

Links full text

Identifiers

Collections

Citation

Export

Metrics

11

Contact Legal Notice Personal Data

A proof of weak termination of typed λσ-calculi

Links full text

Identifiers

Collections

Citation

Export

Share

Metrics

11

Contact Legal Notice Personal Data