Showing 1 - 20 results of 294 for search 'Logic' Narrow Search
Search Tools: Email this Search — Save search to account
1
Report
Teaching Divisibility and Binomials with Coq ; Enseigner divisibilité et binomiaux avec Coq

Authors: Boldo, Sylvie, Clément, François, Hamelin, David, Mayero, Micaela, Rousselin, Pierre

Contributors: Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Simulation for the Environment: Reliable and Efficient Numerical Algorithms (SERENA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Laboratoire Analyse, Géométrie et Applications (LAGA), Université Paris 8 Vincennes-Saint-Denis (UP8)-Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Défi Inria LiberAbaci, Inria, European Project: ERC-2018-SYG-810367,EMC2

Superior Title: https://inria.hal.science/hal-04550762 ; RR-9547, Inria. 2024, pp.13.

Subject Terms: Worksheet, Coq, Arithmetic, Divisibility, Binomial coefficient, Feuille d'exercices, Arithmétique, Divisibilité, Coefficient binomial, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [SHS.EDU]Humanities and Social Sciences/Education

Relation: info:eu-repo/grantAgreement//ERC-2018-SYG-810367/EU/Extreme-scale Mathematically-based Computational Chemistry/EMC2; Report N°: RR-9547; hal-04550762; https://inria.hal.science/hal-04550762; https://inria.hal.science/hal-04550762/document; https://inria.hal.science/hal-04550762/file/RR-9547.pdf

Availability: https://inria.hal.science/hal-04550762
https://inria.hal.science/hal-04550762/document
https://inria.hal.science/hal-04550762/file/RR-9547.pdf


Save to List
2
Report
Unifying lower bounds for algebraic machines, semantically

Authors: Seiller, Thomas, Pellissier, Luc, Léchine, Ulysse

Contributors: Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022), European Project: 659920,H2020,H2020-MSCA-IF-2014,ReACT(2015)

Superior Title: https://hal.science/hal-01921942 ; 2024.

Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1811.06787; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-01921942; https://hal.science/hal-01921942; https://hal.science/hal-01921942v5/document; https://hal.science/hal-01921942v5/file/revised.pdf; ARXIV: 1811.06787

Availability: https://hal.science/hal-01921942
https://hal.science/hal-01921942v5/document
https://hal.science/hal-01921942v5/file/revised.pdf


Save to List
3
Conference
Linear realisability over nets and second order quantification ; Réalisabilité Linéaire dans les réseaux et quantification du second ordre

Authors: Ragot, Adrien, Seiller, Thomas, Tortora de Falco, Lorenzo

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Università degli Studi Roma Tre = Roma Tre University (ROMA TRE), Centre National de la Recherche Scientifique (CNRS), Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS), VINCI PhD fellowship from the Franco-Italian Université., ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022)

Superior Title: Trends in Linear Logic and Applications ; https://hal.science/hal-04131640 ; Trends in Linear Logic and Applications, Jul 2023, Rome, Italy

Subject Terms: Realisability, Proof nets, Correctness, Orthogonality, Linear Logic, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Subject Geographic: Rome, Italy

Relation: hal-04131640; https://hal.science/hal-04131640; https://hal.science/hal-04131640/document; https://hal.science/hal-04131640/file/tlla.pdf

Availability: https://hal.science/hal-04131640
https://hal.science/hal-04131640/document
https://hal.science/hal-04131640/file/tlla.pdf


Save to List
4
Conference
Distributing and Parallelizing Non-canonical Loops

Authors: Aubert, Clément, Rubiano, Thomas, Rusch, Neea, Seiller, Thomas

Contributors: Augusta University, University System of Georgia (USG), Université Paris 13 (UP13), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Superior Title: Verification, Model Checking, and Abstract Interpretation ; Verification, Model Checking, and Abstract Interpretation (VMCAI 2023) ; https://hal.science/hal-03669387 ; Verification, Model Checking, and Abstract Interpretation (VMCAI 2023), Jan 2023, Boston (MA), United States. ⟨10.1007/978-3-031-24950-1_1⟩

Subject Terms: Analysis and Verification of Parallel Program, Automatic Parallelization, Loop Transformation, Program Transformation, Dependency Analysis, Loop Optimization, Abstract Interpretation, Program Analysis, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Subject Geographic: Boston (MA), United States

Time: Boston (MA), United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2206.08760; hal-03669387; https://hal.science/hal-03669387; https://hal.science/hal-03669387v2/document; https://hal.science/hal-03669387v2/file/main.pdf; ARXIV: 2206.08760

Availability: https://doi.org/10.1007/978-3-031-24950-1_1
https://hal.science/hal-03669387
https://hal.science/hal-03669387v2/document
https://hal.science/hal-03669387v2/file/main.pdf

Zugang prüfen (DOI)

Save to List
5
Conference
Unifying Graded Linear Logic and Differential Operators

Authors: Breuvart, Flavien, Kerjean, Marie, Mirwasser, Simon

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Institut des sciences informatiques et de leurs interactions - CNRS Sciences informatiques (INS2I-CNRS), Gaboardi, Marco and van Raamsdonk, Femke}, ANR-18-CE25-0001,CoGITARe,Combiner types gradés et intersections pour l'analyse de ressources(2018), ANR-20-CE48-0002,DIFFERENCE,Théorie de la complexité avec des équations différentielles discrètes(2020), ANR-20-CE48-0014,NuSCAP,Sûreté numérique pour les preuves assistées par ordinateur(2020)

Superior Title: 8th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2023, July 3-6, 2023, Rome, Italy
https://hal.science/hal-03979585
8th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2023, July 3-6, 2023, Rome, Italy, Gaboardi, Marco and van Raamsdonk, Femke}, Jul 2023, Roma, Italy. ⟨10.4230/LIPIcs.FSCD.2023.21⟩

Subject Terms: Linear Logic, Denotational Semantics, Functional Analysis, Graded Logic, Theory of computation → Linear logic, Mathematics of computing → Partial differential equations, Theory of computation → Denotational semantics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Subject Geographic: Roma, Italy

Relation: hal-03979585; https://hal.science/hal-03979585; https://hal.science/hal-03979585v2/document; https://hal.science/hal-03979585v2/file/hal.pdf

Availability: https://doi.org/10.4230/LIPIcs.FSCD.2023.21
https://hal.science/hal-03979585
https://hal.science/hal-03979585v2/document
https://hal.science/hal-03979585v2/file/hal.pdf

Zugang prüfen (DOI)

Save to List
6
Conference
Linear Realisability and Cobordisms

Authors: Maestracci, Valentin, Seiller, Thomas

Contributors: Aix Marseille Université (AMU), Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Université Paris 13 (UP13)-Institut Galilée-Université Sorbonne Paris Cité (USPC)-Centre National de la Recherche Scientifique (CNRS), Sapienza Università Di Roma

Superior Title: FSCD ; https://hal.science/hal-04262206 ; FSCD, Sapienza Università Di Roma, Jul 2023, Rome, Italy

Subject Terms: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Subject Geographic: Rome, Italy

Relation: hal-04262206; https://hal.science/hal-04262206; https://hal.science/hal-04262206/document; https://hal.science/hal-04262206/file/TLLA2023_Maestracci_Seiller_.pdf

Availability: https://hal.science/hal-04262206
https://hal.science/hal-04262206/document
https://hal.science/hal-04262206/file/TLLA2023_Maestracci_Seiller_.pdf


Save to List
7
Conference
Taylor Expansion as a Monad in Models of DiLL

Authors: Kerjean, Marie, Lemay, Jean-Simon Pacaud

Contributors: Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, JSPS Postdoctoral Fellowship, Award #: P21746., ANR-20-CE48-0002,DIFFERENCE,Théorie de la complexité avec des équations différentielles discrètes(2020), ANR-20-CE48-0014,NuSCAP,Sûreté numérique pour les preuves assistées par ordinateur(2020)

Superior Title: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
https://hal.science/hal-03965003
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States. pp.1-13, ⟨10.1109/LICS56636.2023.10175753⟩

Subject Terms: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Subject Geographic: Boston, United States

Time: Boston, United States

Relation: hal-03965003; https://hal.science/hal-03965003; https://hal.science/hal-03965003/document; https://hal.science/hal-03965003/file/TaylorMonad_hal.pdf

Availability: https://doi.org/10.1109/LICS56636.2023.10175753
https://hal.science/hal-03965003
https://hal.science/hal-03965003/document
https://hal.science/hal-03965003/file/TaylorMonad_hal.pdf

Zugang prüfen (DOI)

Save to List
8
Conference
pymwp: A Static Analyzer Determining Polynomial Growth Bounds

Authors: Aubert, Clément, Rubiano, Thomas, Rusch, Neea, Seiller, Thomas

Contributors: Augusta University, University System of Georgia (USG), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS), This material is based upon research supported by the Thomas Jefferson Fund of the Embassy of France in the United States and the FACE Foundation. Thomas Rubiano and Thomas Seiller are also supported by the Île-de-France region through the DIM RFSI project "CoHOp"., https://spots.augusta.edu/caubert/research/statyc/

Superior Title: Automated Technology for Verification and Analysis (ATVA 2023) ; https://hal.science/hal-03269121 ; Automated Technology for Verification and Analysis (ATVA 2023), Oct 2023, Singapour, France. ⟨10.1007/978-3-031-45332-8_14⟩

Subject Terms: Static Program Analysis, Automatic Complexity Analysis, Program Verification, Bound Inference, Flow Analysis, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]

Subject Geographic: Singapour, France

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2107.00097; hal-03269121; https://hal.science/hal-03269121; https://hal.science/hal-03269121v4/document; https://hal.science/hal-03269121v4/file/2023_05_15_standalone.pdf; ARXIV: 2107.00097

Availability: https://doi.org/10.1007/978-3-031-45332-8_14
https://hal.science/hal-03269121
https://hal.science/hal-03269121v4/document
https://hal.science/hal-03269121v4/file/2023_05_15_standalone.pdf

Zugang prüfen (DOI)

Save to List
9
Conference
Comment gagner : expliquer les bonnes trajectoires

Authors: Kazi Aoual, Malik, Rouveirol, Céline, Soldano, Henry, Ventos, Véronique

Contributors: Institut Galilée (IG), Université Sorbonne Paris Nord, NukkAI Paris, Institut de Systématique, Evolution, Biodiversité (ISYEB ), Muséum national d'Histoire naturelle (MNHN)-École Pratique des Hautes Études (EPHE), Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université des Antilles (UA), PFIA

Superior Title: Conférence Nationale en Intelligence Artificielle-PFIA 2023 ; CNIA 2023 - Conférence Nationale en Intelligence Artificielle ; https://hal.science/hal-04157735 ; CNIA 2023 - Conférence Nationale en Intelligence Artificielle, PFIA, Jul 2023, Strasbourg, France. pp.20-30 ; https://pfia23.icube.unistra.fr/conferences/cnia/cnia2023.pdf

Subject Terms: Explanation, Inductive Logic Programming, Abduction, Explications, Programmation Logique Inductive, [INFO]Computer Science [cs], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]

Subject Geographic: Strasbourg, France

Relation: hal-04157735; https://hal.science/hal-04157735; https://hal.science/hal-04157735/document; https://hal.science/hal-04157735/file/Aoual%281%29.pdf

Availability: https://hal.science/hal-04157735
https://hal.science/hal-04157735/document
https://hal.science/hal-04157735/file/Aoual%281%29.pdf


Save to List
10
Conference
From Thin Concurrent Games to Generalized Species of Structures

Authors: Clairambault, Pierre, Olimpieri, Federico, Paquet, Hugo

Contributors: Laboratoire d'Informatique et Systèmes (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (CNRS), University of Leeds, Université Sorbonne Paris Nord, ANR-19-CE48-0010,DYVERSE,Sémantique Dynamique Versatile(2019), ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)

Superior Title: 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
https://hal.science/hal-04244609
2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2023, Boston, United States. pp.1-14, ⟨10.1109/LICS56636.2023.10175681⟩

Subject Terms: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Subject Geographic: Boston, United States

Time: Boston, United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.01082; hal-04244609; https://hal.science/hal-04244609; https://hal.science/hal-04244609/document; https://hal.science/hal-04244609/file/main.pdf; ARXIV: 2302.01082

Availability: https://doi.org/10.1109/LICS56636.2023.10175681
https://hal.science/hal-04244609
https://hal.science/hal-04244609/document
https://hal.science/hal-04244609/file/main.pdf

Zugang prüfen (DOI)

Save to List
11
Conference
A Coq Formalization of Lebesgue Induction Principle and Tonelli's Theorem

Authors: Boldo, Sylvie, Clément, François, Martin, Vincent, Mayero, Micaela, Mouhcine, Houda

Contributors: Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Simulation for the Environment: Reliable and Efficient Numerical Algorithms (SERENA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), Laboratoire Métallographie et Analyse Chimique (LMAC), Commissariat à l'énergie atomique et aux énergies alternatives (CEA), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, European Project: 810367,EMC2(2019)

Superior Title: Proceedings of the 25th International Symposium on Formal Methods ; 25th International Symposium on Formal Methods (FM 2023) ; https://inria.hal.science/hal-03889276 ; 25th International Symposium on Formal Methods (FM 2023), Mar 2023, Lübeck, Germany. pp.39--55, ⟨10.1007/978-3-031-27481-7_4⟩ ; https://fm2023.isp.uni-luebeck.de/

Subject Terms: Formal proof, Coq, Measure theory, Lebesgue integration, Tonelli's theorem, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA]

Subject Geographic: Lübeck, Germany

Relation: info:eu-repo/grantAgreement//810367/EU/Extreme-Scale Mathematically-based Computational Chemistry/EMC2; hal-03889276; https://inria.hal.science/hal-03889276; https://inria.hal.science/hal-03889276v2/document; https://inria.hal.science/hal-03889276v2/file/article.pdf

Availability: https://doi.org/10.1007/978-3-031-27481-7_4
https://inria.hal.science/hal-03889276
https://inria.hal.science/hal-03889276v2/document
https://inria.hal.science/hal-03889276v2/file/article.pdf

Zugang prüfen (DOI)

Save to List
12
Conference
Rewriting Logic Semantics and Symbolic Analysis for Parametric Timed Automata

Authors: Arias, Jaime, Bae, Kyungmin, Olarte, Carlos, Ölveczky, Peter Csaba, Petrucci, Laure, Rømming, Fredrik

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Pohang University of Science and Technology (POSTECH), University of Oslo (UiO)

Superior Title: 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS '22)
https://hal.science/hal-04154095
8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS '22), Dec 2022, Auckland, New Zealand. pp.3-15, ⟨10.1145/3563822.3569923⟩

Subject Terms: Timed automata, rewriting logic, symbolic analysis, parameter synthesis, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Subject Geographic: Auckland, New Zealand

Relation: hal-04154095; https://hal.science/hal-04154095; https://hal.science/hal-04154095/document; https://hal.science/hal-04154095/file/main.pdf

Availability: https://doi.org/10.1145/3563822.3569923
https://hal.science/hal-04154095
https://hal.science/hal-04154095/document
https://hal.science/hal-04154095/file/main.pdf

Zugang prüfen (DOI)

Save to List
14
Conference
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity

Authors: Aubert, Clément, Rubiano, Thomas, Rusch, Neea, Seiller, Thomas

Contributors: Augusta University, University System of Georgia (USG), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS), Amy P. Felty

Superior Title: 7th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2022, August 2-5, 2022, Haifa, Israel
https://hal.science/hal-03596285
7th International Conference on Formal Structures for Computation and Deduction, {FSCD} 2022, August 2-5, 2022, Haifa, Israel, Aug 2022, Haifa, Israel. pp.26:1--26:23, ⟨10.4230/LIPIcs.CVIT.2016.23⟩
Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik

Subject Terms: 2012 ACM Subject Classification Automated static analysis, Complexity theory and logic, Logic and verification phrases Static Program Analysis, Implicit Computational Complexity, Automatic Complexity Analysis, Program Verification, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Subject Geographic: Haifa, Israel

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2203.03943; hal-03596285; https://hal.science/hal-03596285; https://hal.science/hal-03596285/document; https://hal.science/hal-03596285/file/2022_03_03_standalone.pdf; ARXIV: 2203.03943

Availability: https://doi.org/10.4230/LIPIcs.CVIT.2016.23
https://hal.science/hal-03596285
https://hal.science/hal-03596285/document
https://hal.science/hal-03596285/file/2022_03_03_standalone.pdf

Zugang prüfen (DOI)

Save to List
15
Report
A Fibrational Approach to Multiplicative Additive Indexed Linear Logic ; Une approche fibrationnelle de la logique indexée multiplicative additive

Authors: Breuvart, Flavien, Ehrhard, Thomas, Munnich, Nicolas, Olimpieri, Federico

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), School of Chemistry Leeds, University of Leeds

Superior Title: https://hal.science/hal-03978764 ; 2023.

Subject Terms: indexed linear logic, categorical semantics, fibration, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Relation: hal-03978764; https://hal.science/hal-03978764; https://hal.science/hal-03978764/document; https://hal.science/hal-03978764/file/main.pdf

Availability: https://hal.science/hal-03978764
https://hal.science/hal-03978764/document
https://hal.science/hal-03978764/file/main.pdf


Save to List
16
Report
Implicit complexity through linear realisability: polynomial time and probabilistic classes

Authors: Seiller, Thomas

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022), European Project: 659920,H2020,H2020-MSCA-IF-2014,ReACT(2015)

Superior Title: https://hal.science/hal-02458358 ; 2023.

Subject Terms: ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.0: Complexity hierarchies, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes/F.1.3.1: Machine-independent complexity, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2002.00009; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-02458358; https://hal.science/hal-02458358; https://hal.science/hal-02458358v2/document; https://hal.science/hal-02458358v2/file/HAL2023.pdf; ARXIV: 2002.00009

Availability: https://hal.science/hal-02458358
https://hal.science/hal-02458358v2/document
https://hal.science/hal-02458358v2/file/HAL2023.pdf


Save to List
17
Report
Unifying lower bounds for algebraic machines, semantically

Authors: Seiller, Thomas, Pellissier, Luc, Léchine, Ulysse

Contributors: Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022), European Project: 659920,H2020,H2020-MSCA-IF-2014,ReACT(2015)

Superior Title: https://hal.science/hal-01921942 ; 2023.

Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1811.06787; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-01921942; https://hal.science/hal-01921942; https://hal.science/hal-01921942v4/document; https://hal.science/hal-01921942v4/file/main.pdf; ARXIV: 1811.06787

Availability: https://hal.science/hal-01921942
https://hal.science/hal-01921942v4/document
https://hal.science/hal-01921942v4/file/main.pdf


Save to List
18
Report
Lebesgue Induction and Tonelli's Theorem in Coq ; Induction de Lebesgue et théorème de Tonelli en Coq

Authors: Boldo, Sylvie, Clément, François, Martin, Vincent, Mayero, Micaela, Mouhcine, Houda

Contributors: Formally Verified Programs, Certified Tools and Numerical Computations (TOCCATA), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Méthodes Formelles (LMF), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay)-CentraleSupélec-Université Paris-Saclay-Centre National de la Recherche Scientifique (CNRS)-Ecole Normale Supérieure Paris-Saclay (ENS Paris Saclay), Simulation for the Environment: Reliable and Efficient Numerical Algorithms (SERENA), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Centre d'Enseignement et de Recherche en Mathématiques et Calcul Scientifique (CERMICS), École des Ponts ParisTech (ENPC), Laboratoire de Mathématiques Appliquées de Compiègne (LMAC), Université de Technologie de Compiègne (UTC), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Institut National de Recherche en Informatique et en Automatique (INRIA), European Project: 810367,EMC2(2019)

Superior Title: https://inria.hal.science/hal-03564379 ; [Research Report] RR-9457, Institut National de Recherche en Informatique et en Automatique (INRIA). 2023, pp.17.

Subject Terms: Formal proof, Coq, Measure theory, Lebesgue integration, Tonelli theorem, Preuve formelle, Théorie de la mesure, Intégrale de Lebesgue, Théorème de Tonelli, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA], [MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2202.05040; info:eu-repo/grantAgreement//810367/EU/Extreme-Scale Mathematically-based Computational Chemistry/EMC2; Report N°: RR-9457; hal-03564379; https://inria.hal.science/hal-03564379; https://inria.hal.science/hal-03564379v2/document; https://inria.hal.science/hal-03564379v2/file/RR-9457.pdf; https://inria.hal.science/hal-03564379v2/file/pagei.pdf; https://inria.hal.science/hal-03564379v2/file/rrpage1.pdf; ARXIV: 2202.05040

Availability: https://inria.hal.science/hal-03564379
https://inria.hal.science/hal-03564379v2/document
https://inria.hal.science/hal-03564379v2/file/RR-9457.pdf
https://inria.hal.science/hal-03564379v2/file/pagei.pdf
https://inria.hal.science/hal-03564379v2/file/rrpage1.pdf


Save to List
19
Report
A gentle introduction to Girard's Transcendental Syntax for the linear logician

Authors: Eng, Boris

Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord

Superior Title: https://hal.science/hal-02977750 ; 2022.

Subject Terms: Models of Computation, Linear Logic, Semantics, Geometry of Interaction, Realizability semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2012.04752; hal-02977750; https://hal.science/hal-02977750; https://hal.science/hal-02977750v7/document; https://hal.science/hal-02977750v7/file/main.pdf; ARXIV: 2012.04752

Availability: https://hal.science/hal-02977750
https://hal.science/hal-02977750v7/document
https://hal.science/hal-02977750v7/file/main.pdf


Save to List
20
Report
Zeta Functions and the (Linear) Logic of Markov Processes

Authors: Seiller, Thomas

Contributors: Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022), European Project: 659920,H2020,H2020-MSCA-IF-2014,ReACT(2015)

Superior Title: https://hal.science/hal-02458330 ; 2022.

Subject Terms: ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.2: Operational semantics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.2: Modes of Computation/F.1.2.4: Probabilistic computation, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS], [MATH.MATH-PR]Mathematics [math]/Probability [math.PR]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2001.11906; info:eu-repo/grantAgreement//659920/EU/A Realizability Approach to Complexity Theory/ReACT; hal-02458330; https://hal.science/hal-02458330; https://hal.science/hal-02458330v4/document; https://hal.science/hal-02458330v4/file/Markov-Zeta2.pdf; ARXIV: 2001.11906

Availability: https://hal.science/hal-02458330
https://hal.science/hal-02458330v4/document
https://hal.science/hal-02458330v4/file/Markov-Zeta2.pdf


Save to List