المؤلفون: 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

المؤلفون: Carette, Jacques, Heunen, Chris, Kaarsgaard, Robin, Sabry, Amr

المصدر: Carette , J , Heunen , C , Kaarsgaard , R & Sabry , A 2024 , ' With a Few Square Roots, Quantum Computing Is as Easy as Pi ' , Proceedings of the ACM on Programming Languages , vol. 8 , no. POPL , pp. 546-574 . https://doi.org/10.1145/3632861

مصطلحات موضوعية: equational theory, quantum programming language, reversible computing, rig category, unitary quantum computing

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

Relation: https://portal.findresearcher.sdu.dk/da/publications/b2b92f8c-fb9d-4ed8-928b-559d0bf8078d

الاتاحة: https://portal.findresearcher.sdu.dk/da/publications/b2b92f8c-fb9d-4ed8-928b-559d0bf8078d
https://doi.org/10.1145/3632861
https://findresearcher.sdu.dk/ws/files/253605794/3632861.pdf

المؤلفون: Dahlqvist, Fredrik, Neves, Renato Jorge Araújo

المساهمون: Universidade do Minho

مصطلحات موضوعية: λ-calculus, graded modal type, quantitative equational theory, enriched category theory, Ciências Naturais::Ciências da Computação e da Informação

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

Relation: Dahlqvist, F., & Neves, R. (2023, November 23). A Complete V-Equational System for Graded lambda-Calculus. Electronic Notes in Theoretical Informatics and Computer Science. Episciences.org. http://doi.org/10.46298/entics.12299; 2969-2431; https://entics.episciences.org/12299

الاتاحة: https://hdl.handle.net/1822/89615

المؤلفون: Vilmart, Renaud, de Visme, Marc

المساهمون: Quantum Computation Structures (QuaCS), 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), 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)

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

مصطلحات موضوعية: Universality, Equational Theory, Normal Form, ZW-calculus, Finite Dimensional Hilbert Spaces, Qudit systems, Completeness, [INFO]Computer Science [cs]

Relation: hal-04496193; https://hal.science/hal-04496193; https://hal.science/hal-04496193/document; https://hal.science/hal-04496193/file/qudit-ZW.pdf

الاتاحة: https://hal.science/hal-04496193
https://hal.science/hal-04496193/document
https://hal.science/hal-04496193/file/qudit-ZW.pdf

المؤلفون: Dahlqvist, Fredrik, Neves, Renato Jorge Araújo

المساهمون: Universidade do Minho

مصطلحات موضوعية: Enriched category theory, Equational theory, Quantale, λ-calculus, Ciências Naturais::Ciências da Computação e da Informação, Engenharia e Tecnologia::Engenharia Eletrotécnica, Eletrónica e Informática

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

Relation: Fredrik Dahlqvist and Renato Neves. An Internal Language for Categories Enriched over Generalised Metric Spaces. In 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 216, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022) https://doi.org/10.4230/LIPIcs.CSL.2022.16; 9783959772181; 1868-8969

الاتاحة: https://hdl.handle.net/1822/89539

المؤلفون: Silvia Ghilezan, Simona Kašterović

المصدر: Frontiers in Computer Science, Vol 4 (2022)

مصطلحات موضوعية: computational systems, combinatory logic, equational theory, type theory, intersection types, soundness, Electronic computers. Computer science, QA75.5-76.95

وصف الملف: electronic resource

Relation: https://www.frontiersin.org/articles/10.3389/fcomp.2022.792570/full; https://doaj.org/toc/2624-9898

URL الوصول: https://doaj.org/article/993039e16e194a1382ace08587e6ad31

المؤلفون: Santiago Pinazo, Sonia

المساهمون: University/Department: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació

Thesis Advisors: Escobar Román, Santiago

مصطلحات موضوعية: Maude-NPA, Formal verification of cryptographic protocols, Cryptographic protocol analysis, Narrowing-based reachability analysis, Reasoning modulo an equational theory, Variant-based equational unification, Standard rewritring-based model checking, Sequential protocol composition, Indistinguishability, Asymmetric unification, Equational unification, Efficient crytographic protocol analysis, State space reduction techniques, LENGUAJES Y SISTEMAS INFORMATICOS

URL الوصول: http://hdl.handle.net/10251/48527

المساهمون: University/Department: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació

Thesis Advisors: Escobar Román, Santiago

مصطلحات موضوعية: Maude-NPA, Formal verification of cryptographic protocols, Cryptographic protocol analysis, Narrowing-based reachability analysis, Reasoning modulo an equational theory, Variant-based equational unification, Standard rewritring-based model checking, Sequential protocol composition, Indistinguishability, Asymmetric unification, Equational unification, Efficient crytographic protocol analysis, State space reduction techniques, LENGUAJES Y SISTEMAS INFORMATICOS

URL الوصول: http://hdl.handle.net/10251/48527

المؤلفون: Delić, Dejan

المصدر: Transactions of the American Mathematical Society, 2000 Jul 01. 352(7), 3065-3101.

URL الوصول: https://www.jstor.org/stable/118198

المؤلفون: Willard, Ross

المصدر: The Journal of Symbolic Logic, 2000 Mar 01. 65(1), 187-200.

URL الوصول: https://www.jstor.org/stable/2586531

المؤلفون: Willard, Ross

المصدر: Transactions of the American Mathematical Society, 1997 Jul 01. 349(7), 2755-2774.

URL الوصول: https://www.jstor.org/stable/2155552

المؤلفون: Gebler, Daniel, Goriac, Eugen-Ioan, Mousavi, Mohammad Reza, 1978

المصدر: eLLIIT – The Linköping – Lund Initiative on IT and Mobile Communication Proceedings Combined 20th International Workshop on Expressiveness in Concurrency and 10th Workshop on Structural Operational Semantics Electronic Proceedings in Theoretical Computer Science. :63-77

مصطلحات موضوعية: Structural Operational Semantics, Equational Theory, Process Algebra, Formal Semantics, Data and Store

وصف الملف: electronic

URL الوصول: https://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-23679
https://doi.org/10.4204/EPTCS.120.6
https://hh.diva-portal.org/smash/get/diva2:651738/FULLTEXT01.pdf

المؤلفون: Santocanale, Luigi

المساهمون: Logique, Interaction, Raisonnement et Inférence, Complexité, Algèbre (LIRICA), Laboratoire d'Informatique et des Systèmes (LIS) (Marseille, Toulon) (LIS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS)-Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Centre National de la Recherche Scientifique (CNRS), Springer, ANR-16-CE91-0002,TICAMORE,Traduction et Découverte des Calculs pour les logiques Modales et dérivées(2016)

المصدر: FOSSACS 2018 ; https://hal.science/hal-01625134 ; FOSSACS 2018, Apr 2018, Thessaloniki, Greece. pp.494--510, ⟨10.1007/978-3-319-89366-2_27⟩

مصطلحات موضوعية: inner union, equational theory, decidability, Natural join, relational lattices, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], [MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT]

جغرافية الموضوع: Thessaloniki, Greece

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1710.11500; hal-01625134; https://hal.science/hal-01625134; https://hal.science/hal-01625134/document; https://hal.science/hal-01625134/file/0.pdf; ARXIV: 1710.11500

الاتاحة: https://hal.science/hal-01625134
https://hal.science/hal-01625134/document
https://hal.science/hal-01625134/file/0.pdf
https://doi.org/10.1007/978-3-319-89366-2_27

المؤلفون: Mclean, Brett

المساهمون: Université Nice Sophia Antipolis - Faculté des Sciences (UNS UFR Sciences), Université Nice Sophia Antipolis (1965 - 2019) (UNS), Laboratoire Jean Alexandre Dieudonné (LJAD), Université Nice Sophia Antipolis (1965 - 2019) (UNS)-Centre National de la Recherche Scientifique (CNRS)-Université Côte d'Azur (UniCA), European Project: 670624,H2020,ERC-2014-ADG,DuaLL(2015)

المصدر: ISSN: 2352-2208 ; Journal of Logical and Algebraic Methods in Programming ; https://hal.univ-cotedazur.fr/hal-03018506 ; Journal of Logical and Algebraic Methods in Programming, 2019.

مصطلحات موضوعية: Kleene algebra, domain, binary relation, equational theory, decidable, [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Relation: info:eu-repo/grantAgreement//670624/EU/Duality in Formal Languages and Logic - a unifying approach to complexity and semantics/DuaLL; hal-03018506; https://hal.univ-cotedazur.fr/hal-03018506; https://hal.univ-cotedazur.fr/hal-03018506/document; https://hal.univ-cotedazur.fr/hal-03018506/file/kleene_jlamp__arxiv_v2.pdf

الاتاحة: https://hal.univ-cotedazur.fr/hal-03018506
https://hal.univ-cotedazur.fr/hal-03018506/document
https://hal.univ-cotedazur.fr/hal-03018506/file/kleene_jlamp__arxiv_v2.pdf

المؤلفون: Francesco Gavazzo, Cecilia Di Florio

المساهمون: Gavazzo, Francesco, Di Florio, Cecilia

مصطلحات موضوعية: quantitative rewriting, metric rewriting, modal graded rewriting, quantitative equational theory, quantalic relations, quantitative calculus of relations

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000910847500063; journal:PROCEEDINGS OF ACM ON PROGRAMMING LANGUAGES; https://hdl.handle.net/11568/1158293; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85146433894

الاتاحة: https://hdl.handle.net/11568/1158293

المؤلفون: Gavazzo F., Di Florio C.

المساهمون: Gavazzo, F., Di Florio, C.

مصطلحات موضوعية: metric rewriting, modal graded rewriting, quantalic relation, quantitative calculus of relation, quantitative equational theory, quantitative rewriting

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000910847500063; volume:7; issue:POPL; firstpage:1832; lastpage:1863; numberofpages:32; journal:PROCEEDINGS OF ACM ON PROGRAMMING LANGUAGES; https://hdl.handle.net/11577/3510766; info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85146433894

الاتاحة: https://hdl.handle.net/11577/3510766
https://doi.org/10.1145/3571256

المؤلفون: Ashikhmin D. N., Volkov M. V., Zhang Wen Ting

المصدر: Demonstratio Mathematica, Vol 48, Iss 4, Pp 475-492 (2015)

مصطلحات موضوعية: Kiselman monoids, Catalan monoids, Hecke-Kiselman monoids, semigroup identity, equational theory, finite basis problem, Mathematics, QA1-939

وصف الملف: electronic resource

Relation: http://www.degruyter.com/view/j/dema.2015.48.issue-4/dema-2015-0035/dema-2015-0035.xml?format=INT; https://doaj.org/toc/0420-1213; https://doaj.org/toc/2391-4661

URL الوصول: https://doaj.org/article/d4062cbc0fa64511998e54e1f06e716e

المؤلفون: Žajdela, Gašper

المساهمون: Pretnar, Matija

مصطلحات موضوعية: lambda račun, časovno omejeni viri, modalni tipi, izrek o varnosti, teorija enačb, skladnost, formalizacija, lambda calculus, temporal resources, modal type, safety theorem, equational theory, soundness, formalization, info:eu-repo/classification/udc/510.6

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

Relation: https://repozitorij.uni-lj.si/IzpisGradiva.php?id=150138; https://repozitorij.uni-lj.si/Dokument.php?id=174686&dn=; https://repozitorij.uni-lj.si/Dokument.php?id=174687&dn=; https://plus.cobiss.net/cobiss/si/sl/bib/164319747; http://hdl.handle.net/20.500.12556/RUL-150138

الاتاحة: https://repozitorij.uni-lj.si/IzpisGradiva.php?id=150138
https://repozitorij.uni-lj.si/Dokument.php?id=174686&dn=
https://repozitorij.uni-lj.si/Dokument.php?id=174687&dn=
https://plus.cobiss.net/cobiss/si/sl/bib/164319747
https://hdl.handle.net/20.500.12556/RUL-150138

المؤلفون: Dvir, Yotam, Kammar, Ohad, Lahav, Ori

المساهمون: Sergey, Ilya

المصدر: Dvir, Y, Kammar, O & Lahav, O 2022, An Algebraic Theory for Shared-State Concurrency . in I Sergey (ed.), Programming Languages and Systems: 20th Asian Symposium, APLAS 2022, Auckland, New Zealand, December 5, 2022, Proceedings . Lecture Notes in Computer Science, vol. 13658, pp. 2-24, Asian Symposium on Programming Languages, Auckland, New Zealand, 5/12/22 . https://doi.org/10.1007/978-3-031-21037-2_1

مصطلحات موضوعية: program equivalence, compiler transformations, concurrency, monads, compiler optimisations, shared state, equational theory, program refinement, denotational semantics

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

URL الوصول: https://explore.openaire.eu/search/publication?articleId=od______3094::c2c2b35dcf6f163fc47e36f94872e30f
https://www.pure.ed.ac.uk/ws/files/296913009/main.pdf

المؤلفون: Brunet, Paul, Pous, Damien

المساهمون: Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), Preuves et Langages (PLUME), Université de Lyon-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é Claude Bernard Lyon 1 (UCBL), Plume, ANR-12-IS02-0001,PACE,Processus non-standard: Analyse, Coinduction, Expressivité(2012), European Project: 678157,H2020,ERC-2015-STG,CoVeCe(2016)

المصدر: MFCS ; https://hal.science/hal-01307532 ; MFCS, Aug 2016, Cracovie, Poland. ⟨10.4230/LIPIcs.MFCS.2016.22⟩

مصطلحات موضوعية: Nominal sets, Kleene algebra, equational theory, Coq, [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]

جغرافية الموضوع: Cracovie, Poland

Relation: info:eu-repo/grantAgreement//678157/EU/Coinduction for Verification and Certification/CoVeCe; hal-01307532; https://hal.science/hal-01307532; https://hal.science/hal-01307532v2/document; https://hal.science/hal-01307532v2/file/main.pdf

الاتاحة: https://hal.science/hal-01307532
https://hal.science/hal-01307532v2/document
https://hal.science/hal-01307532v2/file/main.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2016.22