{"id":"https://openalex.org/W6910351600","doi":"https://doi.org/10.4230/lipics.fscd.2025.34","title":"Monad Translations for Higher-Order Logic","display_name":"Monad Translations for Higher-Order Logic","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W6910351600","doi":"https://doi.org/10.4230/lipics.fscd.2025.34"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05151149v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05151149","pdf_url":"https://hal.science/hal-05151149v1/file/LIPIcs.FSCD.2025.34.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FSCD 2025 - 10th International Conference on Formal Structures for Computation and Deduction, Maribel Fern\u00e1ndez, Jul 2025, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2025.34⟩","raw_type":"Conference papers"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-05151149v1/file/LIPIcs.FSCD.2025.34.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Traversi\u00e9, Thomas","orcid":"https://orcid.org/0009-0009-1193-4216"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]},{"id":"https://openalex.org/I4210107720","display_name":"CentraleSup\u00e9lec","ror":"https://ror.org/019tcpt25","country_code":"FR","type":"facility","lineage":["https://openalex.org/I277688954","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Traversi\u00e9, Thomas","raw_affiliation_strings":["Universit\u00e9 Paris-Saclay, CentraleSup\u00e9lec, MICS, Gif-sur-Yvette, France","Universit\u00e9 Paris-Saclay, Inria, CNRS, ENS Paris-Saclay, LMF, Gif-sur-Yvette, France"],"raw_orcid":"https://orcid.org/0009-0009-1193-4216","affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, CentraleSup\u00e9lec, MICS, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I4210107720","https://openalex.org/I277688954"]},{"raw_affiliation_string":"Universit\u00e9 Paris-Saclay, Inria, CNRS, ENS Paris-Saclay, LMF, Gif-sur-Yvette, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I4210107720"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20935819,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.6450999975204468,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.6450999975204468,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.11540000140666962,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.09529999643564224,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/intuitionistic-logic","display_name":"Intuitionistic logic","score":0.8607000112533569},{"id":"https://openalex.org/keywords/minimal-logic","display_name":"Minimal logic","score":0.7376000285148621},{"id":"https://openalex.org/keywords/intermediate-logic","display_name":"Intermediate logic","score":0.6690999865531921},{"id":"https://openalex.org/keywords/many-valued-logic","display_name":"Many-valued logic","score":0.607699990272522},{"id":"https://openalex.org/keywords/classical-logic","display_name":"Classical logic","score":0.4918000102043152},{"id":"https://openalex.org/keywords/law-of-excluded-middle","display_name":"Law of excluded middle","score":0.46149998903274536},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.45089998841285706},{"id":"https://openalex.org/keywords/autoepistemic-logic","display_name":"Autoepistemic logic","score":0.43389999866485596},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.42489999532699585},{"id":"https://openalex.org/keywords/curry\u2013howard-correspondence","display_name":"Curry\u2013Howard correspondence","score":0.41260001063346863}],"concepts":[{"id":"https://openalex.org/C178421362","wikidata":"https://www.wikidata.org/wiki/Q176786","display_name":"Intuitionistic logic","level":3,"score":0.8607000112533569},{"id":"https://openalex.org/C171482190","wikidata":"https://www.wikidata.org/wiki/Q3257974","display_name":"Minimal logic","level":5,"score":0.7376000285148621},{"id":"https://openalex.org/C33203268","wikidata":"https://www.wikidata.org/wiki/Q5361594","display_name":"Intermediate logic","level":3,"score":0.6690999865531921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6291999816894531},{"id":"https://openalex.org/C150889026","wikidata":"https://www.wikidata.org/wiki/Q185502","display_name":"Many-valued logic","level":3,"score":0.607699990272522},{"id":"https://openalex.org/C32241873","wikidata":"https://www.wikidata.org/wiki/Q236975","display_name":"Classical logic","level":2,"score":0.4918000102043152},{"id":"https://openalex.org/C137155000","wikidata":"https://www.wikidata.org/wiki/Q468422","display_name":"Law of excluded middle","level":2,"score":0.46149998903274536},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.45089998841285706},{"id":"https://openalex.org/C3845977","wikidata":"https://www.wikidata.org/wiki/Q4826262","display_name":"Autoepistemic logic","level":4,"score":0.43389999866485596},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.42489999532699585},{"id":"https://openalex.org/C85343465","wikidata":"https://www.wikidata.org/wiki/Q975734","display_name":"Curry\u2013Howard correspondence","level":3,"score":0.41260001063346863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41100001335144043},{"id":"https://openalex.org/C150355047","wikidata":"https://www.wikidata.org/wiki/Q965432","display_name":"Extensionality","level":2,"score":0.4083999991416931},{"id":"https://openalex.org/C93682546","wikidata":"https://www.wikidata.org/wiki/Q1056428","display_name":"Type theory","level":3,"score":0.387800008058548},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.38089999556541443},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3743000030517578},{"id":"https://openalex.org/C110039528","wikidata":"https://www.wikidata.org/wiki/Q8069651","display_name":"Zeroth-order logic","level":4,"score":0.3675000071525574},{"id":"https://openalex.org/C33959348","wikidata":"https://www.wikidata.org/wiki/Q1630568","display_name":"Monad (category theory)","level":3,"score":0.3569999933242798},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.3402000069618225},{"id":"https://openalex.org/C2039508","wikidata":"https://www.wikidata.org/wiki/Q7239631","display_name":"Predicate functor logic","level":5,"score":0.3343999981880188},{"id":"https://openalex.org/C2318724","wikidata":"https://www.wikidata.org/wiki/Q852732","display_name":"Proof theory","level":3,"score":0.3215999901294708},{"id":"https://openalex.org/C62073222","wikidata":"https://www.wikidata.org/wiki/Q1572108","display_name":"Natural deduction","level":2,"score":0.3208000063896179},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.3183000087738037},{"id":"https://openalex.org/C65880906","wikidata":"https://www.wikidata.org/wiki/Q1771121","display_name":"Sequent calculus","level":3,"score":0.3046000003814697},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.30379998683929443},{"id":"https://openalex.org/C2777686260","wikidata":"https://www.wikidata.org/wiki/Q144037","display_name":"Calculus (dental)","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C2777796570","wikidata":"https://www.wikidata.org/wiki/Q2351326","display_name":"Dynamic logic (digital electronics)","level":4,"score":0.29580000042915344},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C70846408","wikidata":"https://www.wikidata.org/wiki/Q220433","display_name":"Logical equivalence","level":3,"score":0.2854999899864197},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2782000005245209},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C160131679","wikidata":"https://www.wikidata.org/wiki/Q2462350","display_name":"Kripke semantics","level":4,"score":0.2734000086784363},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C144760519","wikidata":"https://www.wikidata.org/wiki/Q839490","display_name":"Substructural logic","level":4,"score":0.27160000801086426},{"id":"https://openalex.org/C191222856","wikidata":"https://www.wikidata.org/wiki/Q655328","display_name":"Well-formed formula","level":5,"score":0.2685999870300293},{"id":"https://openalex.org/C28077239","wikidata":"https://www.wikidata.org/wiki/Q841728","display_name":"Linear logic","level":2,"score":0.25859999656677246}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:HAL:hal-05151149v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05151149","pdf_url":"https://hal.science/hal-05151149v1/file/LIPIcs.FSCD.2025.34.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FSCD 2025 - 10th International Conference on Formal Structures for Computation and Deduction, Maribel Fern\u00e1ndez, Jul 2025, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2025.34⟩","raw_type":"Conference papers"},{"id":"pmh:oai:drops-oai.dagstuhl.de:23649","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.34","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol337-fscd2025/LIPIcs.FSCD.2025.34/LIPIcs.FSCD.2025.34.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.fscd.2025.34","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.fscd.2025.34","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05151149v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05151149","pdf_url":"https://hal.science/hal-05151149v1/file/LIPIcs.FSCD.2025.34.pdf","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"FSCD 2025 - 10th International Conference on Formal Structures for Computation and Deduction, Maribel Fern\u00e1ndez, Jul 2025, Birmingham, United Kingdom. ⟨10.4230/LIPIcs.FSCD.2025.34⟩","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.40306681394577026,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W6910351600.pdf","grobid_xml":"https://content.openalex.org/works/W6910351600.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Classical":[0],"logic":[1,7,51,54,57,119],"can":[2,45,147],"be":[3,46],"embedded":[4],"into":[5,52,58,120,151],"intuitionistic":[6,53,56,122,152],"by":[8,19,77],"inserting":[9],"double":[10,25],"negations":[11],"in":[12,95],"formulas.":[13],"Several":[14],"translations":[15,62],"generalize":[16],"this":[17,70,111],"idea":[18],"using":[20],"monad":[21,78],"operators":[22],"instead":[23],"of":[24,35,41,98,140],"negations.":[26],"They":[27],"eliminate":[28],"particular":[29],"axioms,":[30],"for":[31,66,80],"instance":[32],"the":[33,39,85,96,99,156],"principle":[34,40],"excluded":[36],"middle":[37],"or":[38,55],"explosion,":[42],"and":[43,90,106],"therefore":[44],"used":[47],"to":[48,113,136],"embed":[49,114],"classical":[50,116,142,149],"minimal":[59],"logic.":[60,68,82,125],"Such":[61],"have":[63],"been":[64],"defined":[65],"first-order":[67],"In":[69,83],"paper,":[71],"we":[72,130,146],"define":[73],"a":[74,137],"translation,":[75],"parameterized":[76],"operators,":[79],"higher-order":[81,115,121,141],"particular,":[84],"property":[86],"that":[87,132,145],"any":[88],"formula":[89],"its":[91],"translation":[92,112],"are":[93],"equivalent":[94],"presence":[97],"eliminated":[100],"axiom":[101],"holds":[102],"under":[103],"functional":[104],"extensionality":[105],"propositional":[107],"extensionality.":[108],"We":[109],"apply":[110],"(respectively":[117,123],"intuitionistic)":[118],"minimal)":[124],"By":[126],"adapting":[127],"Friedman\u2019s":[128],"trick,":[129],"show":[131],"coherent":[133],"formulas":[134],"correspond":[135],"constructive":[138],"fragment":[139],"logic,":[143],"meaning":[144],"transform":[148],"proofs":[150,153],"without":[154],"modifying":[155],"proven":[157],"statements.":[158]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}