Trocq: Proof Transfer for Free, Beyond Equivalence and Univalence

Συγγραφείς: Cyril Cohen, Enzo Crance, Assia Mahboubi

Συνεισφορές: Cohen, Cyril

Πηγή: ACM Transactions on Programming Languages and Systems. 47:1-40

Θεματικοί όροι: Parametricity, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Proof transfer, Proof assistants, Univalence, Representation independence

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

A Bargain for Mergesorts: How to Prove Your Mergesort Correct and Stable, Almost for Free

Συγγραφείς: Cohen, Cyril, Sakaguchi, Kazuhiko

Συνεισφορές: Sakaguchi, Kazuhiko

Πηγή: Proceedings of the ACM on Programming Languages. 9:1-29

Θεματικοί όροι: FOS: Computer and information sciences, Stable sort, Parametricity, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Mergesort, Interactive theorem proving, Data Structures and Algorithms, Logic in Computer Science, Programming Languages, Data Structures and Algorithms (cs.DS), Logic in Computer Science (cs.LO), Programming Languages (cs.PL)

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2403.08173
https://hal.science/hal-05111866v2
https://hal.science/hal-05111866v2/document
https://doi.org/10.1145/3747505

Session Types for the Concurrent Composition of Interactive Differential Privacy

Συγγραφείς: Sannier, Victor, Baillot, Patrick, Gaboardi, Marco

Συνεισφορές: Sannier, Victor

Πηγή: 2025 IEEE 38th Computer Security Foundations Symposium (CSF). :113-126

Θεματικοί όροι: Differential privacy, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Session types, Operational semantics, Probabilistic languages, Pi-calculus, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL]

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

Σύνδεσμος πρόσβασης: https://hal.science/hal-04719333v3

Formal Modeling of Distributed Architectures with FreeSpec: A Cloud-Based MTD Use Case

Συγγραφείς: Forraz, Hugo, Petremand, Shems, Soyez-Martin, Claire, Nowak, David, Grimaud, Gilles

Συνεισφορές: Forraz, Hugo

Πηγή: 2025 25th International Conference on Control Systems and Computer Science (CSCS). :568-571

Θεματικοί όροι: [INFO.INFO-SY] Computer Science [cs]/Systems and Control [cs.SY], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO] Computer Science [cs]

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

Σύνδεσμος πρόσβασης: https://hal.science/hal-05185254v1

Observational Equality Meets CIC

Συγγραφείς: Pujet, Loïc, Leray, Yann, Tabareau, Nicolas

Συνεισφορές: Pujet, Loïc

Πηγή: ACM Transactions on Programming Languages and Systems. 47:1-35

Θεματικοί όροι: Observational equality, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Type theory, Proof assistants, Rewriting rules, Inductive types

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

Σύνδεσμος πρόσβασης: https://hal.science/hal-05085635v1/document
https://hal.science/hal-05085635v1
https://doi.org/10.1145/3719342

Graphical Conditions for the Existence, Unicity and Number of Regular Models

Συγγραφείς: Trinh, Van-Giang, Benhamou, Belaid, Soliman, Sylvain, Fages, François

Συνεισφορές: Trinh, Van-Giang, Pedro Cabalar, Francesco Fabiano, Martin Gebser, Gopal Gupta and Theresa Swift

Πηγή: Electronic Proceedings in Theoretical Computer Science. 416:175-187

Θεματικοί όροι: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, semantics of negation, Datalog, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Discrete Mathematics (cs.DM), Computer Science - Artificial Intelligence, Boolean network, feedback vertex set, Logic in Computer Science (cs.LO), canonical model, logic programming, Artificial Intelligence (cs.AI), three-valued model, abstract argumentation, model counting, Computer Science - Discrete Mathematics

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2502.09220
https://amu.hal.science/hal-04708861v1/document
https://doi.org/10.4204/eptcs.416.16
https://amu.hal.science/hal-04708861v1

Intrinsically Correct Sorting in Cubical Agda

Συγγραφείς: Cass Alexandru, Vikraman Choudhury, Jurriaan Rot, Niels van der Weide

Συνεισφορές: Choudhury, Vikraman, Stark, K.

Πηγή: Stark, K. (ed.), CPP '25: 14th ACM SIGPLAN International Conference on Certified Programs and Proofs Denver CO USA January 20-21, 2025, pp. 34-49

Θεματικοί όροι: [MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO], Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Software Science, Mathematics - Combinatorics, F.3.2, Mathematics - Category Theory, F.3.1, [MATH.MATH-CT] Mathematics [math]/Category Theory [math.CT]

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2412.08362
https://hdl.handle.net/2066/316735
https://repository.ubn.ru.nl//bitstream/handle/2066/316735/316735.pdf

Detecting Misleading Information with LLMs and Explainable ASP

Συγγραφείς: Nguyen, Quang-Anh, Pham, Thu-Trang, Vuong, Thi-Hai-Yen, Trinh, Van-Giang, Thanh, Nguyen

Συνεισφορές: Trinh, Van-Giang

Πηγή: Proceedings of the 17th International Conference on Agents and Artificial Intelligence. :1327-1334

Θεματικοί όροι: LLM, [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], ASP, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], misleading information detection, explainability

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

Graphical Analysis of Abstract Argumentation Frameworks via Boolean Networks

Συγγραφείς: Trinh, Van-Giang, Benhamou, Belaid, Risch, Vincent

Συνεισφορές: Trinh, Van-Giang

Πηγή: Proceedings of the 17th International Conference on Agents and Artificial Intelligence. :745-756

Θεματικοί όροι: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], Extension-Based Semantics, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Abstract Argumentation Framework, [MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS], Graphical Analysis, Boolean Network

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

Σύνδεσμος πρόσβασης: https://inria.hal.science/hal-04917990v1/document
https://inria.hal.science/hal-04917990v1
https://doi.org/10.5220/0013346400003890

Weakly-sparse and strongly flip-flat classes of graphs are uniformly almost-wide

Συγγραφείς: Ghasemi, Fatemeh, Grange, Julien, Kanté, Mamadou Moustapha, Madelaine, Florent

Συνεισφορές: Kanté, Mamadou

Θεματικοί όροι: [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Almost-wide, Flip-flatness

Σύνδεσμος πρόσβασης: https://hal.science/hal-05332862v1

Teaching Divisibility and Binomials with Coq

Συγγραφείς: Boldo, Sylvie, Clément, François, Hamelin, David, Mayero, Micaela, Rousselin, Pierre

Συνεισφορές: Clement, Francois

Πηγή: Electronic Proceedings in Theoretical Computer Science. 419:124-139

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Arithmetic, 4. Education, Divisibility, [SHS.EDU] Humanities and Social Sciences/Education, Feuille d'exercices, Coefficient binomial, Logic in Computer Science (cs.LO), Divisibilité, Binomial coefficient, Coq, Arithmétique, Worksheet

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.12676
https://inria.hal.science/hal-04550762v2
https://inria.hal.science/hal-04550762v2/document
https://hal.science/hal-04725586v3
https://hal.science/hal-04725586v3/document
https://doi.org/10.4204/eptcs.419.8
https://hal.science/hal-04725586v2
https://hal.science/hal-04725586v2/document

Designing a Safe Forward Chaining Tactic Using Productive Proofs

Συγγραφείς: Kaustuv Chaudhuri, Arunava Gantait, Dale Miller

Συνεισφορές: Chaudhuri, Kaustuv, Gian Luca Pozzato, Tarmo Uustalu

Πηγή: Lecture Notes in Computer Science ISBN: 9783032060846

Θεματικοί όροι: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]

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

Σύνδεσμος πρόσβασης: https://inria.hal.science/hal-05157939v1

Distributed controller synthesis for deadlock avoidance

Συγγραφείς: Gimbert, Hugo, Mascle, Corto, Muscholl, Anca, Walukiewicz, Igor

Συνεισφορές: Hugo Gimbert and Corto Mascle and Anca Muscholl and Igor Walukiewicz, Walukiewicz, Igor

Πηγή: Logical Methods in Computer Science. 21

Θεματικοί όροι: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic in Computer Science, 0102 computer and information sciences, 02 engineering and technology, lock synchronisation, deadlock avoidance, concurrent systems, 01 natural sciences, Distributed Synthesis, Logic in Computer Science (cs.LO), Deadlock Avoidance, Lock Synchronisation, Concurrency, 0202 electrical engineering, electronic engineering, information engineering, ddc:004

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2204.12409
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.125
https://hal.science/hal-03808894v1
https://hal.science/hal-03808894v1/document
https://doi.org/10.4230/lipics.icalp.2022.125

Gröbner Bases for Boolean Function Minimization

Συγγραφείς: Faroß, Nicolas, Schwarz, Simon

Συνεισφορές: Weidenbach, Christoph

Πηγή: Mathematics in Computer Science. 19

Θεματικοί όροι: Multi-level Logic Optimization, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Boolean Function Synthesis, Gröbner Bases, Multi-level Logic Optimization Boolean Function Synthesis Gröbner Bases

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

Σύνδεσμος πρόσβασης: https://inria.hal.science/hal-04315477v1

A Curry-Howard Correspondence for Linear, Reversible Computation

Συγγραφείς: Chardonnet, Kostia, Saurin, Alexis, Valiron, Benoît

Συνεισφορές: Saurin, Alexis, Kostia Chardonnet and Alexis Saurin and Benoît Valiron

Πηγή: Logical Methods in Computer Science. 21

Θεματικοί όροι: FOS: Computer and information sciences, Theory of computation → Linear logic, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic in Computer Science, Curry-Howard, 0102 computer and information sciences, 02 engineering and technology, Linear Logic, 01 natural sciences, Logic in Computer Science (cs.LO), Reversible Computation, 0202 electrical engineering, electronic engineering, information engineering, Theory of computation → Equational logic and rewriting, ddc:004

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2302.11887
https://hal.science/hal-04308283v1/document
https://doi.org/10.4230/lipics.csl.2023.13
https://hal.science/hal-04308283v1
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.13

All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants: Sort Polymorphism for Proof Assistants

Συγγραφείς: Josselin Poiret, Gaëtan Gilbert, Kenji Maillard, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau, Éric Tanter

Συνεισφορές: Poiret, Josselin

Πηγή: Proceedings of the ACM on Programming Languages. 9:2253-2281

Θεματικοί όροι: [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], proof assistants, Theory of computation → Type theory type theory, type theory

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

Σύνδεσμος πρόσβασης: https://nantes-universite.hal.science/hal-04801739v1/document
https://nantes-universite.hal.science/hal-04801739v1
https://doi.org/10.1145/3704912

CATEGORICAL FOUNDATIONS OF FORMALIZED CONDENSED MATHEMATICS

Συγγραφείς: DAGUR ASGEIRSSON, RICCARDO BRASCA, NIKOLAS KUHN, FILIPPO ALBERTO EDOARDO NUCCIO MORTARINO MAJNO DI CAPRIGLIO, ADAM TOPAZ

Συνεισφορές: Nuccio Mortarino Majno di Capriglio, Filippo Alberto Edoardo, University of Copenhagen = Københavns Universitet (UCPH), Institut de Mathématiques de Jussieu - Paris Rive Gauche (IMJ-PRG (UMR_7586)), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), University of Oslo (UiO), Institut Camille Jordan (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS), Université Jean Monnet - Saint-Étienne (UJM), Combinatoire, théorie des nombres (CTN), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université Jean Monnet - Saint-Étienne (UJM)-Centre National de la Recherche Scientifique (CNRS)-École Centrale de Lyon (ECL), University of Alberta, CPH-GEOTOP DNRF151, NSERC discovery grant RGPIN-2019-04762, Research Council of Norway grant 302277– Orthogonal gauge duality and non-commutative geometry, ANR-10-LABX-0070,MILYON,Community of mathematics and fundamental computer science in Lyon(2010)

Πηγή: The Journal of Symbolic Logic. :1-28

Θεματικοί όροι: FOS: Computer and information sciences, MSC 18F10, Computer Science - Logic in Computer Science, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Formalization of Mathematics, Formal Languages and Automata Theory (cs.FL), [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Mathematics - Category Theory, Computer Science - Formal Languages and Automata Theory, [MATH.MATH-CT] Mathematics [math]/Category Theory [math.CT], 01 natural sciences, Proof Assistant Lean, Logic in Computer Science (cs.LO), [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], FOS: Mathematics, Category Theory (math.CT), Condensed Mathematics, 0101 mathematics, Grothendieck Topos, [MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT], Category theory, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2407.12840
https://hal.science/hal-04633614v2
https://hal.science/hal-04633614v2/document
https://doi.org/10.1017/jsl.2024.69

Property-Based Testing by Elaborating Proof Outlines

Συγγραφείς: Miller, Dale, Momigliano, Alberto

Συνεισφορές: Miller, Dale, Laboratoire d'informatique de l'École polytechnique Palaiseau (LIX), École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS), Automatisation et ReprésenTation: fOndation du calcUl et de la déducTion (PARTOUT), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-École polytechnique (X), Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)-Centre Inria de l'Institut Polytechnique de Paris, Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre Inria de Saclay, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Università degli Studi di Milano = University of Milan (UNIMI)

Πηγή: Theory and Practice of Logic Programming. 24:1123-1162

Θεματικοί όροι: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL], [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], λ-tree syntax, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, relational specifications, [INFO] Computer Science [cs], 01 natural sciences, metatheory of programming languages, [INFO.INFO-PL] Computer Science [cs]/Programming Languages [cs.PL], Logic in Computer Science (cs.LO), linear logic, 0202 electrical engineering, electronic engineering, information engineering, [INFO]Computer Science [cs], property-based testing, meta-theory of programing languages

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2406.10053
https://hal.science/hal-04710992v1/document
https://hal.science/hal-04710992v1
https://hdl.handle.net/2434/1120939
https://doi.org/10.1017/s1471068424000176

On the Road to Paradise: Some Logical Steps

Συγγραφείς: Plagnol, Arnaud

Συνεισφορές: Plagnol, Arnaud

Πηγή: Logica Universalis. 18:533-545

Θεματικοί όροι: [SHS.PSY] Humanities and Social Sciences/Psychology, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [SHS] Humanities and Social Sciences, [SHS.RELIG] Humanities and Social Sciences/Religions

Σύνδεσμος πρόσβασης: https://hal.science/hal-04170966v1

Queries With Exact Truth Values in Paraconsistent Description Logics

Συγγραφείς: Bienvenu, Meghyn, Bourgaux, Camille, Kozhemiachenko, Daniil

Συνεισφορές: Bourgaux, Camille

Πηγή: Proceedings of the TwentyFirst International Conference on Principles of Knowledge Representation and Reasoning. :145-155

Θεματικοί όροι: [INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI], FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Logic in Computer Science, Logic, Databases (cs.DB), Logic in Computer Science (cs.LO), Databases, Artificial Intelligence (cs.AI), Artificial Intelligence, FOS: Mathematics, [INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB], [MATH.MATH-LO] Mathematics [math]/Logic [math.LO], Logic (math.LO)

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

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2408.07283
https://hal.science/hal-04730579v1