المؤلفون: Jonsson Kling, Filip, Lundqvist, Samuel, 1978, Nicklasson, Lisa

المصدر: Journal of Algebra. 649:12-34

مصطلحات موضوعية: Complete intersection, Binomial ideal, Macaulay's inverse system, Resultant, Term-rewriting

وصف الملف: print

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-229354
https://doi.org/10.1016/j.jalgebra.2024.03.012

المؤلفون: Guo, Liye, Hagens, Kasper, Kop, Cynthia, Vale, Deivid

المساهمون: Liye Guo and Kasper Hagens and Cynthia Kop and Deivid Vale

مصطلحات موضوعية: Higher-order term rewriting, constrained rewriting, dependency pairs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 306, 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.57

الاتاحة: https://doi.org/10.4230/LIPIcs.MFCS.2024.57
https://nbn-resolving.org/urn:nbn:de:0030-drops-206137
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.57

المؤلفون: Baillot, Patrick, Dal Lago, Ugo, Kop, Cynthia, Vale, Deivid

المساهمون: Analyse symbolique et conception orientée composants pour des systèmes embarqués temps-réel modulaires (SYCOMORES), Inria Lille - Nord Europe, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS)-Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 (CRIStAL), Centrale Lille-Université de Lille-Centre National de la Recherche Scientifique (CNRS), Fondements opérationnels, logiques et algébriques des systèmes logiciels (OLAS), Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Dipartimento di Informatica - Scienza e Ingegneria Bologna (DISI), Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO)-Alma Mater Studiorum Università di Bologna = University of Bologna (UNIBO), Radboud University Nijmegen, This work is supported by the NWO TOP project “Implicit Complexity through Higher-Order Rewriting”, NWO 612.001.803/7571, the NWO VIDI project “Constrained Higher-Order Rewriting and Program Equivalence”, NWO VI.Vidi.193.075, and the ERC CoG “Differential Program Semantics”, GA 818616.

المصدر: Lecture notes in computer science ; FoSSaCS 2024 - 27th International Conference on Foundations of Software Science and Computation Structures ; https://hal.science/hal-04743265 ; FoSSaCS 2024 - 27th International Conference on Foundations of Software Science and Computation Structures, Apr 2024, Luxembourg, Luxembourg. pp.70-91, ⟨10.1007/978-3-031-57231-9_4⟩ ; https://link.springer.com/book/10.1007/978-3-031-57231-9

مصطلحات موضوعية: Basic Feasible Functions, Higher-Order Term Rewriting, Tuple Interpretations, Computational Complexity, [INFO]Computer Science [cs]

جغرافية الموضوع: Luxembourg

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2401.12385v2; ARXIV: 2401.12385v2

الاتاحة: https://hal.science/hal-04743265
https://hal.science/hal-04743265v1/document
https://hal.science/hal-04743265v1/file/paper_basicFeasibleFunctionals.pdf
https://doi.org/10.1007/978-3-031-57231-9_4

المؤلفون: Mahe, Erwan, Bannour, Boutheina, Gaston, Christophe, Lapitre, Arnault, Le Gall, Pascale

المصدر: Digital Library Association for Computing Machinery, 12–22, (2024-06-06) ; FormaliSE, 2024 IEEE/ACM 12th International Conference on Formal Methods in Software Engineering, Lisbon, Portugal, 14-20 April 2024

مصطلحات موضوعية: Interaction language, Sequence Diagram, Message Sequence Chart, Non-deterministic Finite Automaton, Operational Semantics, Term Rewriting

Relation: https://zenodo.org/communities/eu; https://doi.org/10.1145/3644033.3644382; oai:zenodo.org:11609027

الاتاحة: https://doi.org/10.1145/3644033.3644382

المؤلفون: Chen, Hubie, Mengel, Stefan

المساهمون: Hubie Chen and Stefan Mengel

مصطلحات موضوعية: width, query rewriting, structural decomposition, term rewriting

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 290, 27th International Conference on Database Theory (ICDT 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.16

الاتاحة: https://doi.org/10.4230/LIPIcs.ICDT.2024.16
https://nbn-resolving.org/urn:nbn:de:0030-drops-197984
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICDT.2024.16

المؤلفون: Aoto, Takahito, Nishida, Naoki, Schöpf, Jonas

المساهمون: Takahito Aoto and Naoki Nishida and Jonas Schöpf

مصطلحات موضوعية: constrained equation, constrained equational theory, logically constrained term rewriting, algebraic semantics, consistency

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.31

الاتاحة: https://doi.org/10.4230/LIPIcs.FSCD.2024.31
https://nbn-resolving.org/urn:nbn:de:0030-drops-203607
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.31

المؤلفون: Thiemann, René, Yamada, Akihisa

المساهمون: René Thiemann and Akihisa Yamada

مصطلحات موضوعية: Isabelle/HOL, pattern matching, term rewriting

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.27

الاتاحة: https://doi.org/10.4230/LIPIcs.FSCD.2024.27
https://nbn-resolving.org/urn:nbn:de:0030-drops-203566
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.27

المؤلفون: Saito, Teppei, Hirokawa, Nao

المساهمون: Teppei Saito and Nao Hirokawa

مصطلحات موضوعية: Term rewriting, Relative termination, Semantic labeling, Dependency pairs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.13

الاتاحة: https://doi.org/10.4230/LIPIcs.FSCD.2024.13
https://nbn-resolving.org/urn:nbn:de:0030-drops-203423
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.13

المؤلفون: Burke, Nigel

المساهمون: Johnstone, Peter

مصطلحات موضوعية: 514, Homotopy theory, Model categories, Monoids, Term rewriting

URL الوصول: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.834573

المؤلفون: Erkens, Rick

المصدر: Erkens , R 2024 , ' Optimizing term rewriting with creeper trace transducers ' , Journal of Logical and Algebraic Methods in Programming , vol. 141 , 100987 . https://doi.org/10.1016/j.jlamp.2024.100987

مصطلحات موضوعية: Optimization, Term rewriting, Transducers

وصف الملف: application/pdf

الاتاحة: https://research.tue.nl/en/publications/09ad8ade-6f54-4fc9-a896-c311d45f332a
https://doi.org/10.1016/j.jlamp.2024.100987
https://pure.tue.nl/ws/files/347093545/1-s2.0-S2352220824000415-main.pdf
http://www.scopus.com/inward/record.url?scp=85194870097&partnerID=8YFLogxK

المؤلفون: Baudon, Thaïs, Fuhs, Carsten, Gonnord, Laure

المساهمون: Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Compilation et Analyse, Logiciel et Matériel (CASH), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon), Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Lyon, Institut National de Recherche en Informatique et en Automatique (Inria), Birbeck University, Laboratoire de Conception et d'Intégration des Systèmes (LCIS), Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), Université Grenoble Alpes (UGA)-Université Grenoble Alpes (UGA), Conception et Test de SYStèmes embarqués (CTSYS), Université Grenoble Alpes (UGA)-Université Grenoble Alpes (UGA)-Université Grenoble Alpes (UGA)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP), ANR-17-CE23-0004,CODAS,Ordonnancement de programmes à structures de données complexes(2017)

المصدر: ISSN: 0169-2968.

مصطلحات موضوعية: Term rewriting, confluence, complexity analysis, parallelism, static analysis, [INFO]Computer Science [cs]

الاتاحة: https://hal.science/hal-04673500
https://hal.science/hal-04673500v1/document
https://hal.science/hal-04673500v1/file/2305.18250v2.pdf

المؤلفون: Rosset, Aloïs, Zwart, Maaike, Hansen, Helle Hvid, Endrullis, Jörg

المساهمون: König, Barbara, Urbat, Henning

المصدر: Rosset , A , Zwart , M , Hansen , H H & Endrullis , J 2024 , Correspondence Between Composite Theories and Distributive Laws . in B König & H Urbat (eds) , Coalgebraic Methods in Computer Science : 17th IFIP WG 1.3 International Workshop, CMCS 2024, Colocated with ETAPS 2024, Proceedings . Lecture Notes in Computer Science , vol. 14617 LNCS , Springer Science and Business Media Deutschland GmbH , pp. 194-215 , 17th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2024 , Luxembourg City , Luxembourg , 06/04/2024 . https://doi.org/10.1007/978-3-031-66438-0_10

مصطلحات موضوعية: algebraic theory, composite theory, distributive law, monad, term rewriting

وصف الملف: application/pdf

Relation: urn:ISBN:9783031664373

الاتاحة: https://hdl.handle.net/11370/688fdb51-724b-422f-a580-8274018ab8c8
https://research.rug.nl/en/publications/688fdb51-724b-422f-a580-8274018ab8c8
https://doi.org/10.1007/978-3-031-66438-0_10
https://pure.rug.nl/ws/files/1098033357/978-3-031-66438-0_10.pdf
http://www.scopus.com/inward/record.url?scp=85200693721&partnerID=8YFLogxK

المؤلفون: 新谷, 喜楽

مصطلحات موضوعية: term rewriting, confluence, decreasing diagrams, parallel closedness, automation

وصف الملف: application/pdf

URL الوصول: https://ndlsearch.ndl.go.jp/books/R100000039-I13122897

Degree: 博士(情報科学) -- 北陸先端科学技術大学院大学

المؤلفون: Pagin, Peter, 1953

المصدر: Compositionality The Review of Symbolic Logic. 14(3):551-591

مصطلحات موضوعية: Compositionality, semantics, computational complexity, term rewriting, Theoretical Philosophy, teoretisk filosofi

وصف الملف: electronic

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-202547
https://su.diva-portal.org/smash/get/diva2:1642171/FULLTEXT01.pdf

المؤلفون: Curien, Pierre-Louis, Laplante-Anfossi, Guillaume

المساهمون: Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)), Centre National de la Recherche Scientifique (CNRS)-Université Paris Cité (UPCité), School of Mathematics and Statistics Melbourne, Faculty of Science Melbourne, University of Melbourne-University of Melbourne, Andrew Sisson Fund, Australian Research Council Future Fellowship FT210100256

المصدر: https://hal.science/hal-04520995 ; 2024.

مصطلحات موضوعية: Term rewriting, nestohedra, hypergraph polytopes, categorified operads, categorical coherence, MacLane coherence theorem, Primary 68Q42, Secondary 18N20, 52B11, [MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-AT]Mathematics [math]/Algebraic Topology [math.AT], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2403.15987; ARXIV: 2403.15987

الاتاحة: https://hal.science/hal-04520995
https://hal.science/hal-04520995v2/document
https://hal.science/hal-04520995v2/file/Coherence2_HAL.pdf

المؤلفون: Leidinger, Hendrik, Weidenbach, Christoph

المساهمون: Max-Planck-Institut für Informatik (MPII), Max-Planck-Gesellschaft, Modeling and Verification of Distributed Algorithms and Systems (VERIDIS), Max-Planck-Gesellschaft-Max-Planck-Gesellschaft-Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Formal Methods (LORIA - FM), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Max Planck Institute for Informatics Saarbrücken

المصدر: ISSN: 0168-7433.

مصطلحات موضوعية: First-order logic with equality Term rewriting Model-based reasoning, First-order logic with equality, Term rewriting, Model-based reasoning, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

الاتاحة: https://inria.hal.science/hal-04313698
https://inria.hal.science/hal-04313698v1/document
https://inria.hal.science/hal-04313698v1/file/s10817-023-09673-3.pdf
https://doi.org/10.1007/s10817-023-09673-3

المؤلفون: Payet, Etienne

المساهمون: Laboratoire d'Informatique et de Mathématiques (LIM), Université de La Réunion (UR), Akihisa Yamada

المصدر: Proceedings of the 19th International Workshop on Termination (WST 2023) ; Workshop on Termination (WST) ; https://hal.univ-reunion.fr/hal-04315644 ; Workshop on Termination (WST), Akihisa Yamada, Aug 2023, Obergurgl, Austria. ⟨10.48550/arXiv.2307.11549⟩

مصطلحات موضوعية: Term Rewriting, Logic Programming, Theory of computation, Logic in Computer Science, Computer and information sciences, Rewrite systems, Program analysis phrases Non-Termination, Constraint and logic programming, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

جغرافية الموضوع: Obergurgl, Austria

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2307.11549; hal-04315644; https://hal.univ-reunion.fr/hal-04315644; https://hal.univ-reunion.fr/hal-04315644/document; https://hal.univ-reunion.fr/hal-04315644/file/wst23.pdf; ARXIV: 2307.11549

الاتاحة: https://hal.univ-reunion.fr/hal-04315644
https://hal.univ-reunion.fr/hal-04315644/document
https://hal.univ-reunion.fr/hal-04315644/file/wst23.pdf
https://doi.org/10.48550/arXiv.2307.11549

المؤلفون: Kohl, Christina, Middeldorp, Aart

المساهمون: Christina Kohl and Aart Middeldorp

مصطلحات موضوعية: Term rewriting, confluence, certification

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 268, 14th International Conference on Interactive Theorem Proving (ITP 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.38

الاتاحة: https://doi.org/10.4230/LIPIcs.ITP.2023.38
https://nbn-resolving.org/urn:nbn:de:0030-drops-184130
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITP.2023.38

المؤلفون: Dwyer Satterfield, Saraid, Erbatur, Serdar, Marshall, Andrew M., Ringeissen, Christophe

المساهمون: Saraid Dwyer Satterfield and Serdar Erbatur and Andrew M. Marshall and Christophe Ringeissen

مصطلحات موضوعية: Term rewriting, security protocols, verification

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2023.30

الاتاحة: https://doi.org/10.4230/LIPIcs.FSCD.2023.30
https://nbn-resolving.org/urn:nbn:de:0030-drops-180148
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2023.30

المؤلفون: Hirokawa, Nao, Middeldorp, Aart

المساهمون: Nao Hirokawa and Aart Middeldorp

مصطلحات موضوعية: battle of Hercules and Hydra, term rewriting, termination

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2023.12

الاتاحة: https://doi.org/10.4230/LIPIcs.FSCD.2023.12
https://nbn-resolving.org/urn:nbn:de:0030-drops-179965
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2023.12