Böhm and Taylor for All!

Συγγραφείς: Dufour, Aloÿs, Mazza, Damiano

Συνεισφορές: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS)

Πηγή: 9th International on Formal Structure for Computation Deduction
https://hal.science/hal-04797294
9th International on Formal Structure for Computation Deduction, Jul 2024, Tallinn, Estonia. ⟨10.4230/LIPIcs.FSCD.2024.29⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation Linear logic Differential linear logic Taylor expansion of lambda-terms Böhm trees Process calculi .FSCD.2024.26, Theory of computation Linear logic, Differential linear logic, Taylor expansion of lambda-terms, Böhm trees, Process calculi .FSCD.2024.26, Linear logic, Process calculi, Theory of computation → Linear logic, Theory of computation → Denotational semantics, Theory of computation → Operational semantics, Theory of computation → Lambda calculus, Theory of computation → Process calculi, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Θέμα γεωγραφικό: Tallinn, Estonia

Time: Tallinn, Estonia

Διαθεσιμότητα: https://hal.science/hal-04797294
https://hal.science/hal-04797294v1/document
https://hal.science/hal-04797294v1/file/BohmTaylor.pdf
https://doi.org/10.4230/LIPIcs.FSCD.2024.29

Parallelism in Soft Linear Logic

Συγγραφείς: Jacobé de Naurois, Paulin

Συνεισφορές: Laboratoire d'Informatique de Paris-Nord (LIPN), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS)

Πηγή: Computer Science Logic ; https://hal.science/hal-03374648 ; Computer Science Logic, Feb 2022, Göttingen, Germany. ⟨10.4230/LIPIcs.10⟩

Θεματικοί όροι: 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation → Complexity theory and logic phrases Implicit Complexity, Typing, Linear Logic, Functional Programming, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Θέμα γεωγραφικό: Göttingen, Germany

Διαθεσιμότητα: https://hal.science/hal-03374648
https://hal.science/hal-03374648v1/document
https://hal.science/hal-03374648v1/file/PSLL-CSL%20-%20Final.pdf
https://doi.org/10.4230/LIPIcs.10

Parallelism in Soft Linear Logic

Συγγραφείς: Jacobé de Naurois, Paulin

Συνεισφορές: Gouat, Isabelle, Paulin Jacobé de Naurois, Jacobé De Naurois, Paulin

Θεματικοί όροι: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], 2012 ACM Subject Classification Theory of computation → Linear logic, Theory of computation → Complexity theory and logic phrases Implicit Complexity, Implicit Complexity, Functional Programming, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], ddc:004, Typing, Linear Logic

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hal-lirmm.ccsd.cnrs.fr/lirmm-03271468v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2022.26
https://hal.science/hal-03374648v1
https://doi.org/10.4230/lipics...10
https://hal.science/hal-03374648v1/document